𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

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

Book ID
121566403
Publisher
SP MAIK Nauka/Interperiodica
Year
2013
Tongue
English
Weight
388 KB
Volume
49
Category
Article
ISSN
0032-9460

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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 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