✦ LIBER ✦

An extremal problem in hypergraph coloring

✍ Scribed by F Sterboul

Publisher: Elsevier Science
Year: 1977
Tongue: English
Weight: 311 KB
Volume: 22
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(77)90007-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An extremal coloring problem on matrices

✍ Hans-Dietrich O.F Gronau; Roger Labahn 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 201 KB

On An Extremal Hypergraph Problem Of Bro

On An Extremal Hypergraph Problem Of Brown, Erdős And Sós

✍ Noga Alon*; Asaf Shapira† 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 286 KB

Extremal Problems for Geometric Hypergra

Extremal Problems for Geometric Hypergraphs

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

On an Extremal Problem for Colored Trees

✍ P. Valtr 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 93 KB

Let T be a tree such that there is a proper n-coloring c of the vertices of T which, besides a technical condition, is a k b k a k -free, i.e., T contains no subdivision of a path u 1 , . . . , Then T has O(kn) vertices. (The technical condition requires that T contains no subdivision of a properly

Digraph extremal problems, hypergraph ex

Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures

✍ W.G Brown; M Simonovits 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 747 KB

We consider extremal problems 'of Tur~ type' for r-uniform ordered hypergraphs, where multiple oriented edges are permitted up to multiplicity q. With any such '(r, q)-graph' G" we associate an r-linear form whose maximum over the standard (n -1)-simplex in R" is called the (graph-) density g(G ") o

An extremal problem

✍ R. E. L. Turner 📂 Article 📅 1968 🏛 Akadmiai Kiad 🌐 English ⚖ 178 KB