✦ LIBER ✦

Cores of random r-partite hypergraphs

✍ Scribed by Fabiano C. Botelho; Nicholas Wormald; Nivio Ziviani

Book ID: 113663277
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 170 KB
Volume: 112
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2011.10.017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Coverings and matchings in r-partite hyp

Coverings and matchings in r-partite hypergraphs

✍ Douglas S. Altner; J. Paul Brooks 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 332 KB

On Hamilton cycle decompositions of -uni

On Hamilton cycle decompositions of -uniform -partite hypergraphs

✍ Schroeder, Michael W. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 387 KB

Quasi-Random Hypergraphs

✍ F. R. K. Chung and R. L. Graham 📂 Article 📅 1989 🏛 National Academy of Sciences 🌐 English ⚖ 469 KB

Judicious Partitions of Hypergraphs

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

We prove the asymptotically best possible result that, for every integer k 2, every 3-uniform graph with m edges has a vertex-partition into k sets such that each set contains at most (1+o(1)) mÂk 3 edges. We also consider related problems and conjecture a more general result. 1997 Academic Press

On partitioning of hypergraphs

✍ Sergei L. Bezrukov; Roberto Battiti 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 648 KB