On the minimal number of edges in color-critical graphs
- 1 September 1997
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 17 (3) , 401-426
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Bounding Ramsey numbers through large deviation inequalitiesRandom Structures & Algorithms, 1995
- Ks-Free Graphs Without Large Kr-Free SubgraphsCombinatorics, Probability and Computing, 1994
- Local and Global Clique NumbersJournal of Combinatorial Theory, Series B, 1994
- Graphs without large triangle free subgraphsDiscrete Mathematics, 1991
- Representations of integers as the sum of k termsRandom Structures & Algorithms, 1990
- On coloring graphs with locally small chromatic numberCombinatorica, 1984
- The Construction of Certain GraphsCanadian Journal of Mathematics, 1962
- A Theorem of R. L. Brooks and a Conjecture of H. HadwigerProceedings of the London Mathematical Society, 1957
- On colouring the nodes of a networkMathematical Proceedings of the Cambridge Philosophical Society, 1941
- ber die Verteilung der Wurzeln bei gewissen algebraischen Gleichungen mit ganzzahligen KoeffizientenMathematische Zeitschrift, 1923