✦ LIBER ✦

Transversals in uniform hypergraphs with property (7,2)

✍ Scribed by Dmitry G. Fon-Der-Flaass; Alexandr V. Kostochka; Douglas R. Woodall

Book ID: 108316371
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 91 KB
Volume: 207
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00114-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Transversals in Uniform Hypergraphs with

Transversals in Uniform Hypergraphs with Property (p,2)

✍ Alexandr V. Kostochka 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 199 KB

Transversals and domination in uniform h

Transversals and domination in uniform hypergraphs

✍ Csilla Bujtás; Michael A. Henning; Zsolt Tuza 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 235 KB

Minimum size transversals in uniform hyp

Minimum size transversals in uniform hypergraphs

✍ Lonc, Zbigniew; Warno, Karolina 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 514 KB

Transversals and matchings in 3-uniform

Transversals and matchings in 3-uniform hypergraphs

✍ Michael A. Henning; Anders Yeo 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 284 KB

On Perfect Matchings in Uniform Hypergra

On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree

✍ Hàn, Hip; Person, Yury; Schacht, Mathias 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 259 KB

Monochromatic Hamiltonian 3-tight Berge

Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs

✍ András Gyárfás; Gábor N. Sárközy; Endre Szemerédi 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

## Abstract Here improving on our earlier results, we prove that there exists an __n__~0~ such that for __n__⩾__n__~0~ in every 2‐coloring of the edges of __K__ there is a monochromatic Hamiltonian 3‐tight Berge cycle. This proves the __c__=2, __t__=3, __r__=4 special case of a conjecture from (P.