On the connection between chromatic number, maximal clique and minimal degree of a graph (1974)
by
B. Andrásfai
,
P Erdos
,
V T Sós
| Venue: | Discrete Math |
| Citations: | 26 - 0 self |
BibTeX
@ARTICLE{Andrásfai74onthe,
author = {B. Andrásfai and P Erdos and V T Sós},
title = {On the connection between chromatic number, maximal clique and minimal degree of a graph},
journal = {Discrete Math},
year = {1974}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Let G n be a graph of n vertices, having chromatic number r which contains no complete graph of r vertices. Then G n contains a vertex of degree not exceeding n(3r-7)í(3r-4). The result is essentially best possible. In this paper we shall use the following notations: Gn denotes a graph of n vertices, without loops and multiple edges; V(G n) respectively E(G, ) the set of vertices respectively the set of edges of G,;
Citations
| 1 | Graphentheoretische Extremalprobleme - unknown authors - 1964 |
| 1 | On a theorem of Rademacher-Turán - unknown authors - 1962 |
