✦ LIBER ✦

An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges

✍ Scribed by Ponomarenko, E. I.; Raigorodskii, A. M.

Book ID: 121799719
Publisher: SP MAIK Nauka/Interperiodica
Year: 2014
Tongue: English
Weight: 181 KB
Volume: 89
Category: Article
ISSN: 1064-5624
DOI: 10.1134/S1064562414010165

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New estimates in the problem of the numb

New estimates in the problem of the number of edges in a hypergraph with forbidden intersections

✍ Ponomarenko, E. I.; Raigorodskii, A. M. 📂 Article 📅 2013 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 388 KB

On the maximum number of edges in a hype

On the maximum number of edges in a hypergraph whose linegraph contains no cycle

✍ J.-C. Bermond; P. Frankl; F. Sterboul 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 122 KB

Soit H = (X. ~1 un hypergraphe h-uniforme avec IX] = net soit L h ~(H! le graphe Jont les sommets reprdsentent les arates de H, deux sommets 6lant reli6s si et seulement si t~s z~r6tes qu'ils reprdsen!ent intersectent en h -1 sommet,=. Nous montrons que sif,, t(H) ne contienl pas de cycle, alors I~[

On the maximum number of edges in a hype

On the maximum number of edges in a hypergraph with a unique perfect matching

✍ Deepak Bal; Andrzej Dudek; Zelealem B. Yilma 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 193 KB

On the Number of Edges in Hypergraphs Cr

On the Number of Edges in Hypergraphs Critical with Respect to Strong Colourings

✍ Alexandr V. Kostochka; Douglas R. Woodall 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 94 KB

A colouring of the vertices of a hypergraph G is called strong if, for every edge A, the colours of all vertices in A are distinct. It corresponds to a colouring of the generated graph (G) obtained from G by replacing every edge by a clique. We estimate the minimum number of edges possible in a k-cr

An improved edge bound on the interval n

An improved edge bound on the interval number of a graph

✍ Jeremy R. Spinrad; G. Vijayan; Douglas B. West 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB 👁 2 views

The upper bound on the interval number of a graph in terms of its number of edges is improved. Also, the interval number of graphs in hereditary classes is bounded in terms of the vertex degrees. A representation of a graph as an intersection graph assigns each vertex a set such that vertices are a

A list version of Dirac's theorem on the

A list version of Dirac's theorem on the number of edges in colour-critical graphs

✍ Alexandr V. Kostochka; Michael Stiebitz 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB 👁 2 views

## Abstract One of the basic results in graph colouring is Brooks' theorem [R. L. Brooks, Proc Cambridge Phil Soc 37 (1941) 194–197], which asserts that the chromatic number of every connected graph, that is not a complete graph or an odd cycle, does not exceed its maximum degree. As an extension o