Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp
From MaRDI portal
Publication:2883860
DOI10.1017/S0963548311000599zbMath1241.05091OpenAlexW1967323669WikidataQ122898026 ScholiaQ122898026MaRDI QIDQ2883860
András Gyárfás, Gábor N. Sárközy
Publication date: 14 May 2012
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548311000599
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)
Related Items (24)
Ramsey number of paths and connected matchings in Ore-type host graphs ⋮ Monochromatic Cycles in 2-Coloured Graphs ⋮ Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree ⋮ Monochromatic cycle partitions of graphs with large minimum degree ⋮ Large monochromatic components in edge colored graphs with a minimum degree condition ⋮ On Schelp's problem for three odd long cycles ⋮ Stars versus stripes Ramsey numbers ⋮ Long monochromatic paths and cycles in 2-colored bipartite graphs ⋮ Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree ⋮ Ramsey numbers of large even cycles and fans ⋮ Ramsey-Turán type results for matchings in edge colored graphs ⋮ Random bipartite Ramsey numbers of long cycles ⋮ Path Ramsey Number for Random Graphs ⋮ Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth ⋮ Monochromatic components in edge-coloured graphs with large minimum degree ⋮ Partitioning 2-edge-colored graphs by monochromatic paths and cycles ⋮ Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\) ⋮ Large monochromatic components in almost complete graphs and bipartite graphs ⋮ Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles ⋮ Bipartite Ramsey numbers of cycles for random graphs ⋮ Matchings with few colors in colored complete graphs and hypergraphs ⋮ Ramsey Number of a Connected Triangle Matching ⋮ Large monochromatic components in 3-colored non-complete graphs ⋮ Towards Lehel's conjecture for 4-uniform tight cycles
Cites Work
- The Ramsey number for a triple of long even cycles
- On 2-factors with \(k\) components
- The 3-colored Ramsey number of even cycles
- Three-color Ramsey numbers for paths
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
- Tripartite Ramsey numbers for paths
- The Ramsey number for stripes
- On Ramsey Graph Numbers for Stars and Stripes
This page was built for publication: Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp