Strong Ramsey theorems for Steiner systems
- 1 January 1987
- journal article
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 303 (1) , 183-192
- https://doi.org/10.1090/s0002-9947-1987-0896015-8
Abstract
It is shown that the class of partial Steiner ( k , l ) (k,\,l) -systems has the edge Ramsey property, i.e., we prove that for every partial Steiner ( k , l ) (k,\,l) -system G \mathcal {G} there exists a partial Steiner ( k , l ) (k,\,l) -system H \mathcal {H} such that for every partition of the edges of H \mathcal {H} into two classes one can find an induced monochromatic copy of G \mathcal {G} . As an application we get that the class of all graphs without cycles of lengths 3 3 and 4 4 has the edge Ramsey property. This solves a longstanding problem in the area.Keywords
This publication has 7 references indexed in Scilit:
- Two Proofs of the Ramsey Property of the Class of Finite HypergraphsEuropean Journal of Combinatorics, 1982
- Rudiments of Ramsey TheoryCBMS Regional Conference Series in Mathematics, 1981
- 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
- Models Without IndiscerniblesThe Journal of Symbolic Logic, 1978
- The Ramsey property for graphs with forbidden complete subgraphsJournal of Combinatorial Theory, Series B, 1976
- On a Problem of Formal LogicProceedings of the London Mathematical Society, 1930