论文信息 - Triangle-Free Graphs with High Minimal Degrees

Triangle-Free Graphs with High Minimal Degrees

The main result of this paper gives a structure of a triangle-free graph of order n with minimal degree greater than 10 n /29. This extends results given by Andrasfai et al. [1] and Haggkvist [6].

Guoping Jin | Guoping Jin

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

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

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

[4] Jan Mycielski. Sur le coloriage des graphs , 1955 .

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

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