A new type of Ramsey-Turan problems
classification
🧮 math.CO
keywords
problemsramsey-turantypebluecoloredcycledegreeedges
read the original abstract
We introduce and study a new type of Ramsey-Turan problems, a typical example of which is the following one: let c>0 and G be a graph of sufficiently large order n with minimum degree >3n/4. If the edges of G are colored in blue or red, then for every 3<k<(1/8-c)n, there exists a monochromatic cycle of length k.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.