Sparse color-critical graphs and hypergr
β
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)__