Let $\sigma_k(H)$ be the minimum sum of the vertex degrees over all non-edges of an $n$-vertex $k$-uniform hypergraph $H$. For every $k\ge3$, $n\geq ks$ and sufficiently large $n$, we establish a sharp Ore-type degree condition that forces a matching of size $s$ in $H$. Specifically, we prove that if \[ \sigma_k(H)>\ma...
Ming-Yang Guo, Tian-Hong Kan, Hong-Liang Lu et al.· 0 citations
For fixed integers $k\ge3$ and $1\le d\le k-1$ and sufficiently large $n\in k\mathbb N$, we establish the sharp minimum $d$-degree thresholds that forces perfect matching in every $n$-vertex $k$-uniform hypergraphs. This was conjectued by Treglown and Zhao, and the $d=1$ case was conjectued by K\"uhn, Osthus and Treglo...
Jie Han, Hong-Liang Lu, Bin Wang et al.· 2 citations
A balanced $k$-partite $k$-graph is a $k$-uniform hypergraph whose vertex set is partitioned into $k$ classes of the same size and whose edges meet every class in exactly one vertex. Lo and Markstr\"om (2014) determined the minimum vertex-degree threshold for perfect matchings when $k=3$, and Lu, Wang and Yuan recently...
Jie Han, Hong-Liang Lu, Bin Wang et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.