Path-path Ramsey type numbers for the complete bipartite graph

DOI10.1016/0095-8956(75)90081-7zbMath0305.05108MaRDI QIDQ1217143

Ralph J. Faudree, Richard H. Schelp

Publication date: 1975

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(75)90081-7

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C15: Coloring of graphs and hypergraphs

Related Items

Vertex coverings by monochromatic paths and cycles, The ith Ramsey number for matchings, The size Ramsey number, Bipartite rainbow Ramsey numbers., Star-path bipartite Ramsey numbers, Some geometric structures and bounds for Ramsey numbers, Path Ramsey numbers in multicolorings, Monochromatic infinite paths, Generalized Ramsey theory for graphs XII: Bipartite Ramsey sets

Cites Work

• Unnamed Item
• Unnamed Item
• Path-cycle Ramsey numbers
• All Ramsey numbers for cycles in graphs
• The Ramsey numbers r(P\(_m\),K\(_n\))
• Path-star Ramsey numbers
• Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
• Ramsey numbers for cycles in graphs
• Generalized Ramsey theory for graphs. I: Diagonal numbers
• On a Ramsey-type problem of J. A. Bondy and P. Erdős. I
• On the existence of specified cycles in complementary graphs
• Generalized Ramsey Theory for Graphs. II. Small Diagonal Numbers
• Some remarks on the theory of graphs