The f-factor problem for graphs and the hereditary property

Frank Niedermeyer; Saharon Shelah; Karsten Steffens

doi:10.1007/s00153-006-0009-z

The f-factor problem for graphs and the hereditary property

Frank Niedermeyer, Saharon Shelah, Karsten Steffens^*

^*Corresponding author for this work

Einstein Institute of Mathematics

Research output: Contribution to journal › Article › peer-review

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 NN₁. 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 NN₁₂-case.

Original language	English
Pages (from-to)	665-672
Number of pages	8
Journal	Archive for Mathematical Logic
Volume	45
Issue number	6
DOIs	https://doi.org/10.1007/s00153-006-0009-z
State	Published - Aug 2006

Access to Document

10.1007/s00153-006-0009-z

Cite this

@article{8de3c2c016264fefad2e21dfa07e187e,

title = "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 NN1. 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 NN12-case.",

author = "Frank Niedermeyer and Saharon Shelah and Karsten Steffens",

year = "2006",

month = aug,

doi = "10.1007/s00153-006-0009-z",

language = "אנגלית",

volume = "45",

pages = "665--672",

journal = "Archive for Mathematical Logic",

issn = "0933-5846",

publisher = "Springer New York",

number = "6",

}

TY - JOUR

T1 - The f-factor problem for graphs and the hereditary property

AU - Niedermeyer, Frank

AU - Shelah, Saharon

AU - Steffens, Karsten

PY - 2006/8

Y1 - 2006/8

N2 - 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 NN1. 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 NN12-case.

AB - 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 NN1. 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 NN12-case.

UR - http://www.scopus.com/inward/record.url?scp=33746760026&partnerID=8YFLogxK

U2 - 10.1007/s00153-006-0009-z

DO - 10.1007/s00153-006-0009-z

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:33746760026

SN - 0933-5846

VL - 45

SP - 665

EP - 672

JO - Archive for Mathematical Logic

JF - Archive for Mathematical Logic

IS - 6

ER -

The f-factor problem for graphs and the hereditary property

Abstract

Access to Document

Other files and links

Fingerprint

Cite this