The f-Factor Problem for Graphs and the Hereditary Property
| dc.creator | Niedermeyer, Frank | |
| dc.creator | Shelah, Saharon | |
| dc.creator | Steffens, Karsten | |
| dc.date | 2004-04-08 | |
| dc.date.accessioned | 2026-07-07T05:07:17Z | |
| dc.date.available | 2026-07-07T05:07:17Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/math/0404179 | |
| dc.identifier | http://arxiv.org/abs/math/0404179 | |
| dc.identifier | Arch. Math. Logic 45 No. 6 (2006) 665--672 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/70803 | |
| dc.subject | Logic | |
| dc.subject | Combinatorics | |
| dc.title | The f-Factor Problem for Graphs and the Hereditary Property | |
| dc.type | text |