Two Ramsey-Tur\'{a}n numbers involving triangles

MaRDI QIDQ6420526zbMATH OpenFDO

Publication date 14 December 2022

Abstract: Given integers

p, q g e 2

, we say that a graph

G

is

(K_{p}, K_{q})

-free if there exists a red/blue edge coloring of

G

such that it contains neither a red

K_{p}

nor a blue

K_{q}

. Fix a function

f (n)

, the Ramsey-Tur'{a}n number

R T (n, p, q, f (n))

is the maximum number of edges in an

n

-vertex

(K_{p}, K_{q})

-free graph with independence number at most

f (n)

. For any

d e l t a > 0

, let

h o (p, q, d e l t a) = m a t h o p l i m l i m i t s_{n o i n f t y} f r a c R T (n, p, q, d e l t a n) n^{2}

. We always call

h o (p, q) := m a t h o p l i m l i m i t s_{d e l t a o 0} h o (p, q, d e l t a)

the Ramsey-Tur'{a}n density of

K_{p}

and

K_{q}

. In 1993, ErdH{o}s, Hajnal, Simonovits, S'{o}s and Szemer'{e}di proposed to determine the value of

h o (3, q)

for

q g e 3

, and they conjectured that for

q g e 2

,

h o l e f t (3, 2 q - 1 i g h t) = f r a c 12 (1 - f r a c 1 r (3, q) - 1)

. Recently, Kim, Kim and Liu (2019) conjectured that for

q g e 2

,

h o (3, 2 q) = f r a c 12 (1 - f r a c 1 r (3, q))

. ErdH{o}s et al. (1993) determined

h o (3, q)

for

q = 3, 4, 5

and

h o (4, 4)

. There is no progress on the Ramsey-Tur'{a}n density

h o (p, q)

in the past thirty years. In this paper, we obtain

h o (3, 6) = f r a c 512

and

h o (3, 7) = f r a c 716

. Moreover, we show that the corresponding asymptotically extremal structures are weakly stable, which answers a problem of ErdH{o}s et al. (1993) for the two cases.

This page was built for publication: Two Ramsey-Tur\'{a}n numbers involving triangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6420526)