The \(f\)-factor problem for graphs and the hereditary property (Q2505509)

Let \(G =(V,E)\) be a graph and \(f\) a function from \(V\) into the cardinals. A subgraph \(F\) of \(G\) (with the same set of vertices) is a \(f\)-factor, if for each \(v \in V\), \(d_F(v) \leq f(v)\) and is called perfect if equality holds. The authors investigate various conditions which are related to the existence of a perfect factor. They show that if \(P\) is a hereditary property, then for countable graphs, \(P\) is a sufficient condition for the existence of a perfect \(f\)-factor. This yields also a sufficient condition for graphs of size \(\aleph_1\). The authors also discuss the \(\aleph_2\)-case. They give two examples of a hereditary property which is even necessary for the existence of a perfect \(f\)-factor.