Abstract
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.
Similar content being viewed by others
References
Fodor G. (1956). Eine Bemerkung zur Theorie der regressiven Funktionen. Acta Sci. Math. (Szeged) 17:139–142
Holz M., Steffens K., Weitz E. (1999). Introduction to cardinal arithmetic, Birkhäuser, Advanced Texts, Basel, Boston, Berlin
Lovász, L., Plummer, M.D.: Matching theory. Ann. Discrete Math. 29, North-Holland (1986)
Niedermeyer, F.: f-optimal factors of infinite graphs. Discrete Math. 95, 231-254, North Holland (1991)
Tutte W.T. (1952). The factors of graphs. Can.J.Math. 4:314–328
Author information
Authors and Affiliations
Corresponding author
Additional information
This paper was supported by the Volkswagen Stiftung
Rights and permissions
About this article
Cite this article
Niedermeyer, F., Shelah, S. & Steffens, K. The f-factor Problem for Graphs and the Hereditary Property. Arch. Math. Logic 45, 665–672 (2006). https://doi.org/10.1007/s00153-006-0009-z
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-006-0009-z