Path-path Ramsey type numbers for the complete bipartite graph

From MaRDI portal
Publication:1217143

DOI10.1016/0095-8956(75)90081-7zbMath0305.05108OpenAlexW2093694010MaRDI 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




Related Items (27)

The ith Ramsey number for matchingsMonochromatic infinite pathsDiagonal Ramsey numbers in multipartite graphs related to starsLong monochromatic paths and cycles in 2-colored bipartite graphsOn size multipartite Ramsey numbers of large paths versus wheel on five verticesComplete bipartite graphs without small rainbow starsAn improvement on Łuczak's connected matchings methodMulticolor bipartite Ramsey numbers for paths, cycles, and stripesComplete bipartite graphs without small rainbow subgraphsOn the cycle-path bipartite Ramsey numberBipartite Ramsey numbers of cyclesBipartite rainbow Ramsey numbers.Bipartite Ramsey numbers of paths for random graphsEmbedding Graphs into Larger Graphs: Results, Methods, and ProblemsOn some three color Ramsey numbers for paths, cycles, stripes and starsBipartite Ramsey numbers for graphs of small bandwidthThe size Ramsey numberStar-path and star-stripe bipartite Ramsey numbers in multicoloringLocal colourings and monochromatic partitions in complete bipartite graphsLong monochromatic paths and cycles in 2-edge-colored multipartite graphsSome geometric structures and bounds for Ramsey numbersMulticolour bipartite Ramsey number of pathsStar-path bipartite Ramsey numbersPath Ramsey numbers in multicoloringsGeneralized Ramsey theory for graphs XII: Bipartite Ramsey setsVertex coverings by monochromatic paths and cyclesGallai-Ramsey numbers for rainbow \(S_3^+\) and monochromatic paths



Cites Work


This page was built for publication: Path-path Ramsey type numbers for the complete bipartite graph