✦ LIBER ✦

Extremal uncrowded hypergraphs

✍ Scribed by M Ajtai; J Komlós; J Pintz; J Spencer; E Szemerédi

Book ID: 103501906
Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 581 KB
Volume: 32
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(82)90049-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Algorithmic Aspects of Uncrowded Hyp

The Algorithmic Aspects of Uncrowded Hypergraphs

✍ Bertram-Kretzberg, Claudia; Lefmann, Hanno 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 504 KB

Extremal Problems for Geometric Hypergra

Extremal Problems for Geometric Hypergraphs

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

Extremal k-edge-hamiltonian Hypergraphs

✍ Péter Prankl; Gyula Y. Katona 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 222 KB

Extremal k-edge-hamiltonian Hypergraphs

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

Derandomizing Chebyshev's inequality to

Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs

✍ Andrés D. Fundia 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 817 KB

In [l] it is proved that an uncrowded (k + 1)-hypergraph of average degree t" contains an independent set of size (cnlt)(ln t ) ' l k . We present a polynomial time algorithm that finds such an independent set by derandomizing the original probabilistic proof. The technique that we use can be applie

On extremal hypergraphs for Hamiltonian

On extremal hypergraphs for Hamiltonian cycles

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