Two Proofs of the Ramsey Property of the Class of Finite Hypergraphs
- 31 December 1982
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 3 (4) , 347-352
- https://doi.org/10.1016/s0195-6698(82)80019-x
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Simple proof of the existence of restricted ramsey graphs by means of a partite constructionCombinatorica, 1981
- Partition theory and its applicationsPublished by Cambridge University Press (CUP) ,1979
- Ramsey theorem for classes of hypergraphs with forbidden complete subhypergraphsCzechoslovak Mathematical Journal, 1979
- Models Without IndiscerniblesThe Journal of Symbolic Logic, 1978
- Partitions of finite relational and set systemsJournal of Combinatorial Theory, Series A, 1977
- A generalization of Ramsey’s theoremPublished by American Mathematical Society (AMS) ,1971
- Graphs with Monochromatic Complete Subgraphs in Every Edge ColoringSIAM Journal on Applied Mathematics, 1970
- Regularity and Positional GamesTransactions of the American Mathematical Society, 1963
- Regularity and positional gamesTransactions of the American Mathematical Society, 1963
- On a Problem of Formal LogicProceedings of the London Mathematical Society, 1930