Some Ramsey-Turán type problems and related questions
From MaRDI portal
Publication:432718
DOI10.1016/j.disc.2011.09.015zbMath1244.05149OpenAlexW1972826452MaRDI QIDQ432718
Publication date: 4 July 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.09.015
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)
Related Items (12)
Ramsey number of paths and connected matchings in Ore-type host graphs ⋮ Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree ⋮ Monochromatic cycle partitions of graphs with large minimum degree ⋮ On Schelp's problem for three odd long cycles ⋮ Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree ⋮ On three-color Ramsey number of paths ⋮ Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Partitioning 2-edge-colored graphs by monochromatic paths and cycles ⋮ Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\) ⋮ Partitioning random graphs into monochromatic components
Cites Work
- Unnamed Item
- Unnamed Item
- A new class of Ramsey-Turán problems
- All Ramsey numbers for cycles in graphs
- The size Ramsey number
- Graphs with linearly bounded Ramsey numbers
- Cycles and stability
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
- Tripartite Ramsey numbers for paths
- Multipartite Ramsey numbers for odd cycles
- A multipartite Ramsey number for odd cycles
- Size Ramsey numbers for small‐order graphs
- The tripartite Ramsey number for trees
- Ramsey-Turán theory
This page was built for publication: Some Ramsey-Turán type problems and related questions
