## 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)__
✦ LIBER ✦
Color-critical graphs and hypergraphs
✍ Scribed by B Toft
- Publisher
- Elsevier Science
- Year
- 1974
- Tongue
- English
- Weight
- 1020 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Sparse color-critical graphs and hypergr
✍
H. L. Abbott; B. Zhou; D. R. Hare
📂
Article
📅
1994
🏛
John Wiley and Sons
🌐
English
⚖ 709 KB
Color-critical graphs and hypergraphs wi
✍
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.
Equipartite colorings in graphs and hype
✍
C Berge; F Sterboul
📂
Article
📅
1977
🏛
Elsevier Science
🌐
English
⚖ 853 KB
Color critical hypergraphs with many edg
✍
V. Rödl; M. Siggers
📂
Article
📅
2006
🏛
John Wiley and Sons
🌐
English
⚖ 275 KB
On splittable colorings of graphs and hy
✍
Zoltán Füredi; Radhika Ramamurthi
📂
Article
📅
2002
🏛
John Wiley and Sons
🌐
English
⚖ 109 KB
## Abstract The notion of a split coloring of a complete graph was introduced by Erdős and Gyárfás [7] as a generalization of split graphs. In this work, we offer an alternate interpretation by comparing such a coloring to the classical Ramsey coloring problem via a two‐round game played against an
On color critical graphs
✍
Vojtech Rödl; Zsolt Tuza
📂
Article
📅
1985
🏛
Elsevier Science
🌐
English
⚖ 555 KB