✦ LIBER ✦

Hypergraphs with no cycle of length 4

✍ Scribed by Ervin Győri; Nathan Lemons

Book ID: 113567363
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 183 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.06.027

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Hypergraphs with no special cycles

✍ Richard Anstee 📂 Article 📅 1983 🏛 Springer-Verlag 🌐 English ⚖ 342 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)__

The structure of well-covered graphs wit

The structure of well-covered graphs with no cycles of length 4

✍ J.I. Brown; R.J. Nowakowski; I.E. Zverovich 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 187 KB

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.

The maximum size of hypergraphs without

The maximum size of hypergraphs without generalized 4-cycles

✍ Oleg Pikhurko; Jacques Verstraëte 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 241 KB