A weaker version of Lovász' path removal conjecture
✍ Scribed by Ken-ichi Kawarabayashi; Orlando Lee; Bruce Reed; Paul Wollan
- Book ID
- 108167441
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 180 KB
- Volume
- 98
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
we established the validity of the main theorem (1.1) for solid bricks. Here, we establish the existence of suitable separating cuts in nonsolid bricks and prove the theorem by applying induction to cut-contractions with respect to such cuts.
We discuss the maximum size of uniform intersecting families with covering number at least {. Among others, we construct a large k-uniform intersecting family with covering number k, which provides a counterexample to a conjecture of Lova sz. The construction for odd k can be visualized on an annulu