A stability result on matchings in 3-uniform hypergraphs

Abstract: Let

n, s, k

be three positive integers such that

1 l e q s l e q (n - k + 1) / k

and let

[n] = 1, l d o t s, n

. Let

H

be a

k

-graph with vertex set

1, l d o t s, n

, and let

e (H)

denote the number of edges of

H

. Let

u (H)

and

a u (H)

denote the size of a largest matching and the size of a minimum vertex cover in

H

, respectively. Define

for

2 l e q i l e q k

and

, where

S = s + 1, l d o t s, s + k

. Frankl and Kupavskii conjectured that if

u (H) l e q s

and

a u (H) > s

, then

e (H) l e q m a x | A_{2}^{k} (n, s) |, l d o t s, | A_{k}^{k} (n, s) |, | H M_{n, s}^{k} |

. In this paper, we prove this conjecture for

k = 3

and sufficiently large

n

.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: A stability result on matchings in 3-uniform hypergraphs