Article contents
Triangle-Free Graphs with High Minimal Degrees
Published online by Cambridge University Press: 12 September 2008
Abstract
The main result of this paper gives a structure of a triangle-free graph of order n with minimal degree greater than 10n/29. This extends results given by Andrásfai et al. [1] and Häggkvist [6].
- Type
- Research Article
- Information
- Copyright
- Copyright © Cambridge University Press 1993
References
[1]Andrásfai, B., Erdős, P. and Sós, V. T. (1974) On the connection between chromatic number, maximal clique and minimal degree of a graph. Discrete Mathematics 8 205–218.CrossRefGoogle Scholar
[3]Bollobás, B. (1979) Graph Theory – An Introductory Course, Graduate Texts in Mathematics 63, Springer-Verlag, New York-Heidelberg-Berlin, 177 pp.Google Scholar
[4]Erdԕs, P. and Simonovits, M. (1973) On a valence problem in extremal graph theory. Discrete Mathematics 5 323–334.CrossRefGoogle Scholar
[5]Grötzsch, H. (1959) Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel, Wiss Z. Martin-Luther Univertität Halle-Wittenberg, Math.-Nat. Reihe 8 109–120.Google Scholar
[6]Häggkvist, R. (1982) Odd cycles of specified length in non-bipartite graphs. In: Bollobás, B. (ed.) Graph Theory. Annals of Discrete Mathematics 13 89–100.Google Scholar
[8]Mycielski, J. (1955) Sur le coloriage des graphes. Colloq. Math. 3 161–162.CrossRefGoogle Scholar
[9]Turán, P. (1941) On an extremal problem in graph theory. Mat. Fiz. Lapok 48 436–452 (in Hungarian).Google Scholar
- 8
- Cited by