On the minimal number of edges in color-critical graphs

Combinatorica

Volumn 17, Issue 3, 1997, Pages 401-426

  Krivelevich, Michael ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031440813     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01215921     Document Type: Article

References (23)

1. N. ALON and J. H. SPENCER: The probabilistic method, Wiley, New York, 1992.
2. B. BOLLOBÁS: Random graphs, Academic Press, New York, 1985.
3. B. BOLLOBÁS and H. R. HIND: Graphs without large triangle-free subgraphs, Discrete Math., 87 (1991), 119-131.
4. R. L. BROOKS: On colouring the nodes of a network, Proc. Cambridge Phil. Soc., 37 (1941), 194-197.
5. G. A. DIRAC: A theorem of R. L. Brooks and a conjecture of H. Hadwiger, Proc. London Math. Soc. 7 (1957), 161-195.
6. P. ERDOS: Some new applications of probability methods to combinatorial analysis and graph theory, Proc. 5th S.E. Conf. in Combinatorics, Graph Theory and Computing, (1974), 39-51.
7. P. ERDOS and C. A. ROGERS: The construction of certain graphs, Canad. J. Math., 14 (1962), 702-707.
8. P. ERDOS and P. TETALI: Representations of integers as the sum of k terms, Random Struct. Alg., 1 (1990), 245-261.
9. M. FEKETE: Über die Verteilung der Wurzeln bei gewissen algebraischen Gleichungen mit ganzzahligen Koefficienten, Math. Z., 17 (1923), 228-249.
10. T. GALLAI: Kritische Graphen I, Publ. Math. Inst. Hungar. Acad. Sci., 8 (1963), 165-192.
11. T. R. JENSEN and B. TOFT: Graph coloring problems, Wiley, New York, 1995.
12. H. A. KIERSTEAD, E. SZEMERÉDI and W. T. TROTTER: On coloring graphs with locally small chromatic number, Combinatorica, 4 (1984), 183-185.
13. r-free subgraphs, Combinat., Probab. Comput., 3 (1994), 349-354.
14. M. KRIVELEVICH: Bounding Ramsey numbers through large deviation inequalities, Random Struct. Alg., 7 (1995), 145-155.
15. N. LINIAL and YU. RABINOVICH: Local and global clique numbers, J. Combin. Theory, Ser. B, 61 (1994), 5-15.
16. T. ŁUCZAK: A note on the sharp concentration of the chromatic number of random graphs, Combinatorica, 11 (1991), 295-297.
17. V. D. MILMAN and G. SCHECHTMAN: Asymptotic theory of finite dimensional normed spaces, Lecture Notes in Mathematics 1200, Springer Verlag, Berlin and New York, 1986.
18. H. SACHS and M. STIEBITZ: Colour-critical graphs with vertices of low valency, Annals of Discrete Math., 41 (1989), 371-396.
19. H. SACHS and M. STIEBITZ: On constructive methods in the theory of colour-critical graphs, Discrete Math., 74 (1989), 201-226.
20. n,p, Combinatorica, 7 (1987), 124-129.
21. M. STIEBITZ: Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs, Combinatorica, 2 (1982), 315-323.
22. B. TOFT: Color-critical graphs and hypergraphs, J. Combin. Theory, Ser. B, 16 (1974), 145-161.
23. D. A. YOUNGS: 4-Chromatic projective graphs, J. Graph Theory, 21 (1996), 219-227.