✦ LIBER ✦

Complete Partite subgraphs in dense hypergraphs

✍ Scribed by Vojtěch Rödl; Mathias Schacht

Book ID: 112187419
Publisher: John Wiley and Sons
Year: 2012
Tongue: English
Weight: 184 KB
Volume: 41
Category: Article
ISSN: 1042-9832
DOI: 10.1002/rsa.20441

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Super-Magic Complete k-Partite Hypergrap

Super-Magic Complete k-Partite Hypergraphs

✍ Marián Trenkler 📂 Article 📅 2001 🏛 Springer Japan 🌐 English ⚖ 84 KB

The number of complete subgraphs of equi

The number of complete subgraphs of equi-partite graphs

✍ Guoping Jin 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 307 KB

Small topological complete subgraphs of

Small topological complete subgraphs of “dense” graphs

✍ A. Kostochka; L. Pyber 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 153 KB

Extremal Problems for Sets Forming Boole

Extremal Problems for Sets Forming Boolean Algebras and Complete Partite Hypergraphs

✍ David S. Gunderson; Vojtěch Rödl; Alexander Sidorenko 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Three classes of finite structures are related by extremal properties: complete d-partite d-uniform hypergraphs, d-dimensional affine cubes of integers, and families of 2 d sets forming a d-dimensional Boolean algebra. We review extremal results for each of these classes and derive new ones for Bool

An algorithm for finding a maximum -matc

An algorithm for finding a maximum -matching excluding complete partite subgraphs

✍ Yusuke Kobayashi; Xin Yin 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 524 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