论文信息 - Triangle-free four-chromatic graphs

Triangle-free four-chromatic graphs

Abstract For given n , let G be a triangle-free graph of order n with chromatic number at least 4. In this paper, we shall prove a conjecture of Haggkvist by determining the maximal value of δ ( G ).

Guoping Jin | Guoping Jin

[1] Paul Erdös,et al. On the connection between chromatic number, maximal clique and minimal degree of a graph , 1974, Discret. Math..

[2] K. Brown,et al. Graduate Texts in Mathematics , 1982 .

[3] Miklós Simonovits,et al. On a valence problem in extremal graph theory , 1973, Discret. Math..

[4] P. Erdös. On an extremal problem in graph theory , 1970 .

[5] B. Bollobás,et al. Extremal Graph Theory , 2013 .

[6] Roland Häggkvist. ODD Cycles of Specified Length in Non-Bipartite Graphs , 1982 .