Codegree threshold for tiling k-graphs with two edges sharing exactly vertices

DOI10.1007/S10114-019-9086-XMaRDI QIDQ2287773zbMATH OpenOpenAlexFDO

Authors Lei Yu, Xinmin Hou

Publication date 21 January 2020

Published in Acta Mathematica Sinica, English Series (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1808.02319

zbMATH Keywords

codegreefactorhypergraph

Mathematics Subject Classification ID

Vertex degrees (05C07) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: Given integer $k$ and a $k$-graph $F$, let $t_{k-1}(n,F)$ be the minimum integer $t$ such that every $k$-graph $H$ on $n$ vertices with codegree at least $t$ contains an $F$-factor. For integers $kgeq3$ and $0leqellleqk-1$, let $mathcal{Y}_{k,ell}$ be a $k$-graph with two edges that shares exactly $ell$ vertices. Han and Zhao (JCTA, 2015) asked the following question: For all $kge3$, $0leelllek-1$ and sufficiently large $n$ divisible by $2k-ell$, determine the exact value of $t_{k-1}(n,mathcal{Y}_{k,ell})$. In this paper, we show that $t_{k-1}(n,mathcal{Y}_{k,ell})=fracn2k-ell$ for $kgeq3$ and $1leqellleqk-2$, combining with two previously known results of R"{o}dl, Ruci'{n}ski and Szemer'{e}di {(JCTA, 2009)} and Gao, Han and Zhao (arXiv, 2016), the question of Han and Zhao is solved completely.

Recommendations

• Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles
• Codegree conditions for tiling complete \(k\)-partite \(k\)-graphs and loose cycles
• Perfect matchings and K₄^3-tilings in hypergraphs of large codegree
• Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs
• Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs

Cites work

• Codegree conditions for tiling complete \(k\)-partite \(k\)-graphs and loose cycles
• Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles
• Forbidding just one intersection
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
• Packing k-partite k-uniform hypergraphs
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• Tiling 3-uniform hypergraphs with K₄^3-2e

Cited in

(3)

• Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles
• Minimum degree thresholds for bipartite graph tiling
• Codegree conditions for tiling complete \(k\)-partite \(k\)-graphs and loose cycles

This page was built for publication: Codegree threshold for tiling \(k\)-graphs with two edges sharing exactly \(\ell\) vertices

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