✦ LIBER ✦

Extremal k-edge-hamiltonian Hypergraphs

✍ Scribed by Péter Prankl; Gyula Y. Katona

Book ID: 104444300
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 222 KB
Volume: 10
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00372-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

✍ Péter Frankl; Gyula Y. Katona 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 280 KB

On extremal hypergraphs for Hamiltonian

On extremal hypergraphs for Hamiltonian cycles

✍ Roman Glebov; Yury Person; Wilma Weps 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 258 KB

On Extremal Hypergraphs for Hamiltonian

On Extremal Hypergraphs for Hamiltonian Cycles

✍ Roman Glebov; Yury Person; Wilma Weps 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 191 KB

Extremal uncrowded hypergraphs

✍ M Ajtai; J Komlós; J Pintz; J Spencer; E Szemerédi 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 581 KB

Hamiltonian chains in hypergraphs

✍ Katona, Gyula Y.; Kierstead, H. A. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

A cyclic ordering of the vertices of a k-uniform hypergraph is called a hamiltonian chain if any k consecutive vertices in the ordering form an edge. For k = 2 this is the same as a hamiltonian cycle. We consider several natural questions about the new notion. The main result is a Dirac-type theorem

Extremal Problems for Geometric Hypergra

Extremal Problems for Geometric Hypergraphs

✍ T. K. Dey; J. Pach 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 128 KB