@article{a5635470a47d4305b9fcfacd1d54f90a,
title = "Tight minimum degree condition for the existence of loose cycle tilings in 3-graphs",
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.",
keywords = "Hypergraph, Loose cycle, Tiling",
author = "Roy Oursler and Andrzej Czygrinow",
note = "Funding Information: \ast Received by the editors October 26, 2017; accepted for publication (in revised form) August 9, 2019; published electronically October 8, 2019. https://doi.org/10.1137/17M1153662 Funding: The first author is partially supported by Simons Foundation grant 521777. \dagger School of Mathematical and Statistical Sciences, Arizona State University, Tempe, AZ 85287 (roursler@asu.edu, aczygri@asu.edu). Publisher Copyright: {\textcopyright}c 2019 Roy Oursler And Andrzej Czygrinow",
year = "2019",
doi = "10.1137/17M1153662",
language = "English (US)",
volume = "33",
pages = "1912--1931",
journal = "SIAM Journal on Discrete Mathematics",
issn = "0895-4801",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "4",
}