✦ LIBER ✦

On Turan hypergraphs

✍ Scribed by M. Lorea

Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 466 KB
Volume: 22
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(78)90061-4

No coin nor oath required. For personal study only.

✦ Synopsis

Let a(H) be the -,t*rbility number of a hypergraph H = (X, a). T(n, L, ar) is the smallest 4 such that there exists :'. k-uniform hypergraph H with n vertices, 4 edges and with a(H) s Q. A k-uniform hypergraph H, with n vertices, T( n, k, cr ) edges and Q!(H) s ~1 is a Turan hypergraph.

The value of T(n, 2, $cr) is given by a theorem of i'urdn. In this paper new lower bounds to T(n, k, ar) are obtainetf and it is proved that an infinity of affine spaces are Turan hypergraphs.

📜 SIMILAR VOLUMES

Multipartite Turán problem for connected

Multipartite Turán problem for connected graphs and hypergraphs

✍ Zsolt Tuza 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 561 KB

Tuza, Z., Multipartite Turan problem for connected graphs and hypergraphs, Discrete Mathematics 112 (1993) 199-206. Giving a partial solution to a problem of Bialostocki and Dierker, we determine the maximum number of edges in a k-chromatic graph G with color classes of given cardinalities n,, , n,,

Turan Devleti

📂 Fiction 🌐 Turkish ⚖ 7 MB

On two Turán Numbers

✍ Jian Shen 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 85 KB

On unavoidable hypergraphs

✍ F. R. K. Chung; P. Erdös 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 518 KB

Observables on hypergraphs

✍ S. P. Gudder; G. T. Rüttimann 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 834 KB

Satisfiability on hypergraphs

✍ Adam Kolany 📂 Article 📅 1993 🏛 Springer Netherlands 🌐 English ⚖ 557 KB