A new class of Ramsey-Turán problems (Q607020): Difference between revisions

It is conjectured that if \(G\) is a \(2\)-edge colored graph of order \(n \geq 4\) with \(\delta(G) > 3n/4\), then there is for every integer \(4 \leq k \leq n/2\) a monochromatic \(C_k\). To support the conjecture it is proved that if \(G\) is a graph of order \(n\) sufficiently large with \(\delta(G) > 3n/4\), then for any \(\varepsilon > 0\) there is monochromatic \(C_k\) for \(4 \leq k \leq (1/8 - \varepsilon)n\) if \(G\) is \(2\)-edge colored. Examples are given to show that the minimum degree condition is sharp in the theorem, and it is also mentioned that a minimum degree condition of \(\delta(G) > 5n/4\) would be needed to get a monochromatic triangle.