Extensions of Gallai–Ramsey results
Authors:
- 21 July 2011
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 70 (4) , 404-426
Abstract
Consider the graph consisting of a triangle with a pendant edge. We describe the structure of rainbow ‐free edge colorings of a complete graph and provide some corresponding Gallai–Ramsey results. In particular, we extend a result of Gallai to find a partition of the vertices of a rainbow ‐free colored complete graph with a limited number of colors between the parts. We also extend some Gallai–Ramsey results of Chung and Graham, Faudree et al. and Gyárfás et al. Copyright © 2011 Wiley Periodicals, Inc. J Graph TheoryKeywords
This publication has 9 references indexed in Scilit:
- Ramsey‐type results for Gallai coloringsJournal of Graph Theory, 2009
- Colored graphs without colorful cyclesCombinatorica, 2007
- Complete graphs with no rainbow pathJournal of Graph Theory, 2006
- Edge colorings of complete graphs without tricolored trianglesJournal of Graph Theory, 2004
- Local Anti-Ramsey Numbers of GraphsCombinatorics, Probability and Computing, 2003
- Edge-colored complete graphs with precisely colored subgraphsCombinatorica, 1983
- Transitiv orientierbare GraphenActa Mathematica Hungarica, 1967
- On a combinatorical problem of K. ZarankiewiczColloquium Mathematicum, 1963
- A partition calculus in set theoryBulletin of the American Mathematical Society, 1956