A ramsey type problem concerning vertex colourings
- 1 May 1991
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 52 (1) , 45-52
- https://doi.org/10.1016/0095-8956(91)90089-3
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The number of submatrices of a given type in a Hadamard matrix and related resultsJournal of Combinatorial Theory, Series B, 1988
- A Ramsey theoretic problem for finite ordered setsDiscrete Mathematics, 1987
- Expanding graphs contain all small treesCombinatorica, 1987
- Eigenvalues, geometric expanders, sorting in rounds, and ramsey theoryCombinatorica, 1986
- On size Ramsey number of paths, trees, and circuits. IJournal of Graph Theory, 1983
- Graphs with Monochromatic Complete Subgraphs in Every Edge ColoringSIAM Journal on Applied Mathematics, 1970