Random bipartite Ramsey numbers of long cycles
From MaRDI portal
Publication:6202936
DOI10.1016/j.dam.2023.12.024MaRDI QIDQ6202936
Publication date: 27 February 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Paths and cycles (05C38) Distance in graphs (05C12) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparse partition universal graphs for graphs of bounded degree
- Improved bounds on the multicolor Ramsey numbers of paths and even cycles
- On the multi-colored Ramsey numbers of paths and even cycles
- The Ramsey number of a graph with bounded maximum degree
- The Ramsey number for a triple of long even cycles
- The 3-colored Ramsey number of even cycles
- All Ramsey numbers for cycles in graphs
- \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
- Sparse multipartite graphs as partition universal for graphs with bounded degree
- Bipartite Ramsey numbers for graphs of small bandwidth
- The Ramsey numbers for a triple of long cycles
- Bipartite Ramsey numbers of cycles for random graphs
- Exact Ramsey numbers of odd cycles via nonlinear optimisation
- Multicolour bipartite Ramsey number of paths
- Multicolour Ramsey numbers of paths and even cycles
- Three-color Ramsey numbers for paths
- New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\)
- Ramsey numbers for cycles in graphs
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
- New lower bound for multicolor Ramsey numbers for even cycles
- Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp
- On the multi-colored Ramsey numbers of cycles
- 3‐Color bipartite Ramsey number of cycles and paths
- Tripartite Ramsey numbers for paths
- A Folkman Linear Family
- An extremal problem for paths in bipartite graphs
- Szemerédi’s Regularity Lemma for Sparse Graphs
- On some Multicolor Ramsey Properties of Random Graphs
- An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths
- Path Ramsey Number for Random Graphs
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Turán‐type problems for long cycles in random and pseudo‐random graphs