Edge-colorings avoiding rainbow and monochromatic subgraphs
- 22 October 2007
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 308 (20) , 4710-4723
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Canonical Pattern Ramsey NumbersGraphs and Combinatorics, 2005
- On a Generalized Anti-Ramsey ProblemCombinatorica, 2001
- On Generalized Ramsey Theory: The Bipartite CaseJournal of Combinatorial Theory, Series B, 2000
- A variant of the classical Ramsey problemCombinatorica, 1997
- A Lower Bound for Schur Numbers and Multicolor Ramsey NumbersThe Electronic Journal of Combinatorics, 1994
- An anti-Ramsey theoremGraphs and Combinatorics, 1985
- Edge-colored complete graphs with precisely colored subgraphsCombinatorica, 1983
- A survey of bounds for classical Ramsey numbersJournal of Graph Theory, 1983
- A Combinatorial TheoremJournal of the London Mathematical Society, 1950
- On the structure of linear graphsBulletin of the American Mathematical Society, 1946