Tight minimum degree condition for the existence of loose cycle tilings in 3-graphs

Roy Oursler, Andrzej Czygrinow

Research output: Contribution to journalArticle

Abstract

Let Ct denote the loose cycle on t = 2s vertices, that is, the 3-uniform hypergraph obtained from a graph cycle C on s vertices by replacing each edge e = { u, v} of C with the edge triple { u, xe, v\} , where xe is uniquely assigned to e. We will give a tight minimum degree condition that guarantees all sufficiently large 3-uniform hypergraphs on n ∈ tZ vertices contain n t vertex disjoint copies of Ct.

Original languageEnglish (US)
Pages (from-to)1912-1931
Number of pages20
JournalSIAM Journal on Discrete Mathematics
Volume33
Issue number4
DOIs
StatePublished - Jan 1 2019
Externally publishedYes

Keywords

  • Hypergraph
  • Loose cycle
  • Tiling

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Tight minimum degree condition for the existence of loose cycle tilings in 3-graphs'. Together they form a unique fingerprint.

  • Cite this