An improvement on Łuczak's connected matchings method
From MaRDI portal
Publication:6133269
DOI10.1112/blms.12587zbMath1519.05169arXiv2009.03119OpenAlexW4220978164MaRDI QIDQ6133269
Publication date: 18 August 2023
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.03119
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (2)
Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ Bipartite Ramsey numbers of cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved bounds on the multicolor Ramsey numbers of paths and even cycles
- The Ramsey number for a triple of long even cycles
- The 3-colored Ramsey number of even cycles
- Fractional matchings and the Edmonds-Gallai theorem
- 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\)
- Multicolour Ramsey numbers of odd cycles
- Exact Ramsey numbers of odd cycles via nonlinear optimisation
- Minimum degree conditions for monochromatic cycle partitioning
- Long monochromatic paths and cycles in 2-edge-colored multipartite graphs
- Matchings with few colors in colored complete graphs and hypergraphs
- Multicolour bipartite Ramsey number of paths
- Three-color Ramsey numbers for paths
- New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\)
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
- A Ramsey-type problem in directed and bipartite graphs
- 3‐Color bipartite Ramsey number of cycles and paths
- Tripartite Ramsey numbers for paths
- Spanning Trees with Few Branch Vertices
- Paths, Trees, and Flowers
- The Factorization of Linear Graphs
- Monochromatic connected matchings in 2‐edge‐colored multipartite graphs
This page was built for publication: An improvement on Łuczak's connected matchings method
