Monochromatic paths in edge-colored graphs

DOI10.1016/0095-8956(72)90009-3zbMath0221.05064OpenAlexW2085877663MaRDI QIDQ2547219

Václav Chvátal

Publication date: 1972

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(72)90009-3

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Monochromatic directed walks in arc-colored directed graphs ⋮ Covering with Euclidean boxes ⋮ Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) ⋮ Ramsey numbers for degree monotone paths ⋮ Local \(k\)-colorings of graphs and hypergraphs ⋮ Ramsey-nice families of graphs ⋮ A Ramsey type result for oriented trees ⋮ Erdős-Szekeres theorem for multidimensional arrays ⋮ On a Ramsey-theoretic property of orders ⋮ Ramsey numbers for tournaments ⋮ Directed Ramsey number for trees ⋮ Some Ramsey nu mbers for directed graphs

Cites Work

• Monochromatic paths and circuits in edge-colored graphs
• Some Combinatorial Theorems on Monotonicity
• Unnamed Item
• Unnamed Item

This page was built for publication: Monochromatic paths in edge-colored graphs