Bipartite Ramsey numbers of cycles

DOI10.1016/j.ejc.2024.103921OpenAlexW4390802235MaRDI QIDQ6201898

Zilong Yan, Yue Jian Peng

Publication date: 26 March 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2024.103921

zbMATH Keywords

maximal connected subgraphRamsey number of cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• Unnamed Item
• Unnamed Item
• The bipartite Ramsey numbers
• The Ramsey number for a triple of long even cycles
• The 3-colored Ramsey number of even cycles
• Cycles in bipartite graphs
• All Ramsey numbers for cycles in graphs
• Path-path Ramsey type numbers for the complete bipartite graph
• \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
• Edge condition for a Hamiltonian bipartite graph to be bipancyclic
• Bipartite Ramsey numbers for graphs of small bandwidth
• Some generalized bipartite Ramsey numbers involving short cycles
• Exact Ramsey numbers of odd cycles via nonlinear optimisation
• Multicolour bipartite Ramsey number of paths
• Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs
• Ramsey numbers for cycles in graphs
• On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
• A Ramsey-type problem in directed and bipartite graphs
• On Hamiltonian bipartite graphs
• A partition calculus in set theory
• 3‐Color bipartite Ramsey number of cycles and paths
• A new upper bound for the bipartite Ramsey problem
• Three‐colored asymmetric bipartite Ramsey number of connected matchings and cycles
• Exact bipartite Turán numbers of large even cycles
• An improvement on Łuczak's connected matchings method

This page was built for publication: Bipartite Ramsey numbers of cycles