Finding a monochromatic subgraph or a rainbow path

DOI10.1002/JGT.20179MaRDI QIDQ3418729zbMATH OpenOpenAlexFDO

Authors András Gyárfás, Jeno Lehel, R. H. Schelp

Publication date 24 January 2007

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20179

zbMATH Keywords

anti-Ramsey problemslocal 2-coloringmulticolored pathRamsey theory

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Recommendations

• More on monochromatic-rainbow Ramsey type theorems
• Gallai-Ramsey numbers involving a rainbow 4-path
• Gallai-Ramsey numbers for rainbow paths
• Generalized Ramsey numbers: forbidding paths with few colors
• On the rainbow Turán number of paths

Cited in

(11)

• Gallai-Ramsey numbers for rainbow paths
• Generalized Ramsey numbers: forbidding paths with few colors
• Bounds for bipartite rainbow Ramsey numbers
• Complete graphs with no rainbow path
• Monochromatic-bichromatic colorings for some small cycles
• Constrained Ramsey Numbers
• Constrained Ramsey numbers
• Rainbow generalizations of Ramsey theory: A survey
• Constrained Ramsey numbers for the loose path, cycle and star
• Complete bipartite graphs without small rainbow stars
• Ramsey and Gallai-Ramsey numbers of cycles and books

This page was built for publication: Finding a monochromatic subgraph or a rainbow path

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3418729)