The f-factor Problem for Graphs and the Hereditary Property
- 25 Downloads
If P is a hereditary property then we show that, for the existence of a perfect f-factor, P is a sufficient condition for countable graphs and yields a sufficient condition for graphs of size ℵ1. Further we give two examples of a hereditary property which is even necessary for the existence of a perfect f-factor. We also discuss the ℵ2-case.
KeywordsBipartite Graph Discrete Math Greek Letter Complete Bipartite Graph Factor Problem
Unable to display preview. Download preview PDF.
- 2.Holz M., Steffens K., Weitz E. (1999). Introduction to cardinal arithmetic, Birkhäuser, Advanced Texts, Basel, Boston, BerlinGoogle Scholar
- 3.Lovász, L., Plummer, M.D.: Matching theory. Ann. Discrete Math. 29, North-Holland (1986)Google Scholar
- 4.Niedermeyer, F.: f-optimal factors of infinite graphs. Discrete Math. 95, 231-254, North Holland (1991)Google Scholar