𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The maximum size of hypergraphs without generalized 4-cycles

✍ Scribed by Oleg Pikhurko; Jacques Verstraëte

Book ID
108167257
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
241 KB
Volume
116
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Maximum Size of 3-Uniform Hypergraph
The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane
✍ Dominique De Caen; Zoltán Füredi 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 73 KB

A conjecture of V. So s [3] is proved that any set of 3 4 ( n 3 )+cn 2 triples from an n-set, where c is a suitable absolute constant, must contain a copy of the Fano configuration (the projective plane of order two). This is an asymptotically sharp estimate.

The 4-Choosability of Plane Graphs witho
The 4-Choosability of Plane Graphs without 4-Cycles
✍ Peter Che Bor Lam; Baogang Xu; Jiazhuang Liu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 179 KB

A graph G is called k-choosable if k is a number such that if we give lists of k colors to each vertex of G there is a vertex coloring of G where each vertex receives a color from its own list no matter what the lists are. In this paper, it is shown that each plane graph without 4-cycles is 4-choosa

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