Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs

Research output: Contribution to journalArticle

3 Scopus citations

Abstract

We show that for every even integer s≥6 there is n0 such that, if H is a 3-uniform hypergraph on nϵsZ, n ≥n0 vertices such that the minimum co-degree of H is at least (Formula presented.), then H can be tiled with copies of a loose cycle on s vertices. The co-degree condition is tight.

Original languageEnglish (US)
Pages (from-to)317-333
Number of pages17
JournalJournal of Graph Theory
Volume83
Issue number4
DOIs
StatePublished - Dec 1 2016

Keywords

  • hypergraphs
  • loose cycles

ASJC Scopus subject areas

  • Geometry and Topology

Fingerprint Dive into the research topics of 'Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs'. Together they form a unique fingerprint.

  • Cite this