Sparse ramsey graphs
- 1 March 1984
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 4 (1) , 71-78
- https://doi.org/10.1007/bf02579159
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Simple proof of the existence of restricted ramsey graphs by means of a partite constructionCombinatorica, 1981
- A short proof of the existence of highly chromatic hypergraphs without short cyclesJournal of Combinatorial Theory, Series B, 1979
- The Ramsey property for graphs with forbidden complete subgraphsJournal of Combinatorial Theory, Series B, 1976
- Graphs with Monochromatic Complete Subgraphs in Every Edge ColoringSIAM Journal on Applied Mathematics, 1970
- On chromatic number of finite set-systemsActa Mathematica Hungarica, 1968
- On chromatic number of graphs and set-systemsActa Mathematica Hungarica, 1966