The f-Factor Problem for Graphs and the Hereditary Property
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 aleph1. 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 aleph2-case.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.