✦ LIBER ✦

Partitioning 3-uniform hypergraphs

✍ Scribed by Jie Ma; Xingxing Yu

Book ID: 113698898
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 291 KB
Volume: 102
Category: Article
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2011.07.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Judicious Partitions of 3-uniform Hyperg

Judicious Partitions of 3-uniform Hypergraphs

✍ B. Bollobás; A.D. Scott 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 113 KB

A conjecture of Bollobás and Thomason asserts that, for r ≥ 1, every r -uniform hypergraph with m edges can be partitioned into r classes such that every class meets at least rm/(2r -1) edges. Bollobás, Reed and Thomason [3] proved that there is a partition in which every edge meets at least (1 -1/e

Packing k-partite k-uniform hypergraphs

✍ Richard Mycroft 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 178 KB

Embedding Factorizations for 3-Uniform H

Embedding Factorizations for 3-Uniform Hypergraphs

✍ Amin Bahmanian; Chris Rodger 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 559 KB

Spanning trees of 3-uniform hypergraphs

✍ Andrew Goodall; Anna de Mier 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 436 KB

Ramsey Properties of Random k-Partite, k

Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs

✍ Rödl, Vojtěch; Ruciński, Andrzej; Schacht, Mathias 📂 Article 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 265 KB

Hamilton decompositions of complete 3-un

Hamilton decompositions of complete 3-uniform hypergraphs

✍ Helen Verrall 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 947 KB

The problem of finding a Hamilton decomposition of the complete 3-uniform hypergraph K,3 has been solved for n = 2 (mod 3) and n = 4(mod 6) . We find here a Hamilton decomposition of Ki, no l(mod 6), and a Hamilton decomposition of the complete 3-uniform hypergraph minus a l-factor, Ki -I, n = 0 (mo