Ramsey classes of set systems
- 31 March 1983
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 34 (2) , 183-201
- https://doi.org/10.1016/0097-3165(83)90055-9
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Two Proofs of the Ramsey Property of the Class of Finite HypergraphsEuropean Journal of Combinatorics, 1982
- Simple proof of the existence of restricted ramsey graphs by means of a partite constructionCombinatorica, 1981
- A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graphDiscrete Mathematics, 1978
- Models Without IndiscerniblesThe Journal of Symbolic Logic, 1978
- Partitions of finite relational and set systemsJournal of Combinatorial Theory, Series A, 1977
- On chromatic number of graphs and set-systemsActa Mathematica Hungarica, 1966