Simple proof of the existence of restricted ramsey graphs by means of a partite construction
- 1 June 1981
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 1 (2) , 199-202
- https://doi.org/10.1007/bf02579274
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A short proof of the existence of highly chromatic hypergraphs without short cyclesJournal of Combinatorial Theory, Series B, 1979
- Partition theory and its applicationsPublished by Cambridge University Press (CUP) ,1979
- A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graphDiscrete Mathematics, 1978
- 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 a Problem of Formal LogicProceedings of the London Mathematical Society, 1930