On Extensions of a Conjecture of Gallai
β
AndrΓ© E. KΓ©zdy; Hunter S. Snevily
π
Article
π
1997
π
Elsevier Science
π
English
β 307 KB
A graph G is k-critical if it has chromatic number k but every proper subgraph of G has a (k&1)-coloring. We prove the following result. If G is a k-critical graph of order n>k 3, then G contains fewer than n&3kΓ5+2 complete subgraphs of order k&1.