Improved bound on vertex degree version of Erdős matching conjecture

Abstract: For a

k

-uniform hypergraph

H

, let

d e l t a_{1} (H)

denote the minimum vertex degree of

H

, and

u (H)

denote the size of the largest matching in

H

. In this paper, we show that for any

k g e q 3

and

, there exists an integer

such that for positive integers

n g e q n_{0}

and

, if

H

is an

n

-vertex

k

-graph with

d e l t a_{1} (H) > n - 1 c h o o s e k - 1 - n - m c h o o s e k - 1,

then

u (H) g e q m

. This improves upon earlier results of Bollob'{a}s, Daykin and ErdH{o}s (1976) for the range

n > 2 k^{3} (m + 1)

and Huang and Zhao (2017) for the range

n g e q 3 k^{2} m

.

Recommendations

Cites work

Cited in

(4)

This page was built for publication: Improved bound on vertex degree version of Erdős matching conjecture