✦ LIBER ✦

A short proof of the existence of highly chromatic hypergraphs without short cycles

✍ Scribed by Jaroslav Nešetřil; Vojtěch Rödl

Book ID: 107884111
Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 167 KB
Volume: 27
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(79)90084-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ahypergraph-free construction of highly

Ahypergraph-free construction of highly chromatic graphs without short cycles

✍ Igor Kříž 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 128 KB

A short proof for the existence of the W

A short proof for the existence of the WZ-factorisation

✍ Michael Kaps; Michael Schlegl 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 145 KB

A short proof of the existence of 2-sequ

A short proof of the existence of 2-sequencings in dihedral groups

✍ Cheng-De Wang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 92 KB

We give a specific construction of 2-sequencings in the dihedral groups O4k. A finite group G is called sequenceable, if its elements can be listed: a2,a3 ..... an,

A short proof of the existence of k-satu

A short proof of the existence of k-saturated partitions of partially ordered sets

✍ Michael Saks 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 258 KB

Acyclic 5-choosability of planar graphs

Acyclic 5-choosability of planar graphs without adjacent short cycles

✍ O. V. Borodin; A. O. Ivanova 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB 👁 1 views

The conjecture on acyclic 5-choosability of planar graphs [Borodin et al., 2002] as yet has been verified only for several restricted classes of graphs. None of these classes allows 4-cycles. We prove that a planar graph is acyclically 5-choosable if it does not contain an i-cycle adjacent to a j-cy

A short proof of the Oslo algorithm

✍ Hartmut Prautzsch 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 73 KB