The f-Factor Problem for Graphs and the Hereditary Property
Logic
2007-05-23 v1 Combinatorics
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 aleph_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 aleph_2-case.
Keywords
Cite
@article{arxiv.math/0404179,
title = {The f-Factor Problem for Graphs and the Hereditary Property},
author = {Frank Niedermeyer and Saharon Shelah and Karsten Steffens},
journal= {arXiv preprint arXiv:math/0404179},
year = {2007}
}