Unavoidable subgraphs of colored graphs
Authors:
- Jonathan CutlerJCJonathan Cutler
- Balázs MontághBMBalázs Montágh
- 1 October 2008
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 308 (19) , 4396-4413
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- An upper bound for some ramsey numbersJournal of Graph Theory, 1988
- On the number of homogeneous subgraphs of a graphCombinatorica, 1984
- Ramsey's theorem—A new lower boundJournal of Combinatorial Theory, Series A, 1975
- On a combinatorical problem of K. ZarankiewiczColloquium Mathematicum, 1963
- On a problem of K. ZarankiewiczColloquium Mathematicum, 1954
- Some remarks on the theory of graphsBulletin of the American Mathematical Society, 1947
- On a Problem of Formal LogicProceedings of the London Mathematical Society, 1930