✦ LIBER ✦

Hypergraphs with no special cycles

✍ Scribed by Richard Anstee

Book ID: 110564334
Publisher: Springer-Verlag
Year: 1983
Tongue: English
Weight: 342 KB
Volume: 3
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02579287

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hypergraphs with no cycle of length 4

✍ Ervin Győri; Nathan Lemons 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 183 KB

Hypergraphs with no odd cycle of given l

Hypergraphs with no odd cycle of given length

✍ Ervin Győri; Nathan Lemons 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 166 KB

Sparse color-critical graphs and hypergr

Sparse color-critical graphs and hypergraphs with no short cycles

✍ H. L. Abbott; B. Zhou; D. R. Hare 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 709 KB

## Abstract We give constructions of color‐critical graphs and hypergraphs with no short cycles and with relatively few edges. In particular, we show that, for each __n__ ≧ 3, the smallest number of edges in a 3‐critical triangle‐free __n__‐graph (hypergraph) with __m__ vertices is __m__ + __o(m)__

Color-critical graphs and hypergraphs wi

Color-critical graphs and hypergraphs with few edges and no short cycles

✍ H.L. Abbott; D.R. Hare; B. Zhou 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 378 KB

We give constructions of color-critical graphs and hypergraphs with no cycles of length 5 or shorter and with relatively few edges.

Graphs whose neighborhoods have no speci

Graphs whose neighborhoods have no special cycles

✍ A.E. Brouwer; P. Duchet; A. Schrijver 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 480 KB

To a graph G is canonically associated its neighborhood-hypergraph, X(G), formed by the closed neighborhoods of the vertices of G. We characterize the graphs G such that (i) X(G) has no induced cycle, or (ii) #(G) is a balanced hypergraph or (iii) X(G) is triangle free. (i) is another short proof of

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