A new class of Ramsey-Turán problems

DOI10.1016/j.disc.2010.09.009zbMath1203.05101arXiv1001.2078OpenAlexW2012190037MaRDI QIDQ607020

Hao Li, Vladimir Nikiforov, Richard H. Schelp

Publication date: 19 November 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1001.2078

zbMATH Keywords

edge-coloringminimum degreemonochromatic cyclesRamsey-Turán

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (6)

Monochromatic Cycles in 2-Coloured Graphs ⋮ On Schelp's problem for three odd long cycles ⋮ Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree ⋮ Some Ramsey-Turán type problems and related questions ⋮ A multipartite Ramsey number for odd cycles ⋮ The Monochromatic Circumference of 2‐Edge‐Colored Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• All Ramsey numbers for cycles in graphs
• Nearly bipartite graphs
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• A note on cycle lengths in graphs
• Cycles and stability
• Pancyclic graphs. I
• On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
• On maximal paths and circuits of graphs
• Ramsey-Turán theory

This page was built for publication: A new class of Ramsey-Turán problems