Monochromatic infinite paths

DOI10.1016/0012-365X(93)90508-QzbMath0787.05071WikidataQ105719861 ScholiaQ105719861MaRDI QIDQ2366010

Fred Galvin, Paul Erdős

Publication date: 29 June 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

densitycoloringmonochromatic infinite path

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (6)

Density of monochromatic infinite paths ⋮ Ramsey upper density of infinite graph factors ⋮ Upper density of monochromatic paths in edge-coloured infinite complete graphs and bipartite graphs ⋮ Some Ramsey-type theorems ⋮ Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs ⋮ Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey

Cites Work

• Some Ramsey-type theorems
• All Ramsey numbers for cycles in graphs
• Path-path Ramsey type numbers for the complete bipartite graph
• On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
• A Ramsey-type problem in directed and bipartite graphs
• Monochromatic Paths in Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Monochromatic infinite paths