𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Quasi-Random Hypergraphs

✍ Scribed by F. R. K. Chung and R. L. Graham

Book ID
123637451
Publisher
National Academy of Sciences
Year
1989
Tongue
English
Weight
469 KB
Volume
86
Category
Article
ISSN
0027-8424

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Hypergraphs, Quasi-randomness, and Condi
Hypergraphs, Quasi-randomness, and Conditions for Regularity
✍ Yoshiharu Kohayakawa; VojtΔ›ch RΓΆdl; Jozef Skokan πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 286 KB

Haviland and Thomason and Chung and Graham were the first to investigate systematically some properties of quasi-random hypergraphs. In particular, in a series of articles, Chung and Graham considered several quite disparate properties of random-like hypergraphs of density 1/2 and proved that they a

Choosability in Random Hypergraphs
Choosability in Random Hypergraphs
✍ Michael Krivelevich; Van H. Vu πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 155 KB

The choice number of a hypergraph H=(V, E) is the least integer s for which, for every family of color lists S=[S(v): v # V], satisfying |S(v)|=s for every v # V, there exists a choice function f so that f (v) # S(v) for every v # V, and no edge of H is monochromatic under f. In this paper we consid

Ramsey Properties of Random Hypergraphs
Ramsey Properties of Random Hypergraphs
✍ Vojtech RΓΆdl; Andrzej RuciΕ„ski πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 501 KB

Let K (k) (n, p) be the random k-uniform hypergraph obtained by independent inclusion of each of the ( n k ) k-tuples with probability p. For an arbitrary k-uniform hypergraph G and every integer r we find the threshold for the property that every r-coloring of the vertices of K (k) (n, p) results i

Cores of random r-partite hypergraphs
Cores of random r-partite hypergraphs
✍ Fabiano C. Botelho; Nicholas Wormald; Nivio Ziviani πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 170 KB