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

Research output: Contribution to journalArticle

2 Citations (Scopus)

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 ⌈s/4⌉sn, then H can be tiled with copies of a loose cycle on s vertices. The co-degree condition is tight.

Original languageEnglish (US)
JournalJournal of Graph Theory
DOIs
StateAccepted/In press - 2015

Fingerprint

Degree Condition
Uniform Hypergraph
Packing
Cycle
Integer
Graph in graph theory

Keywords

  • Hypergraphs
  • Loose cycles

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

@article{d737226a3b5344d281da2a0d8b5850e3,
title = "Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs",
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 ⌈s/4⌉sn, then H can be tiled with copies of a loose cycle on s vertices. The co-degree condition is tight.",
keywords = "Hypergraphs, Loose cycles",
author = "Andrzej Czygrinow",
year = "2015",
doi = "10.1002/jgt.21998",
language = "English (US)",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",

}

TY - JOUR

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

AU - Czygrinow, Andrzej

PY - 2015

Y1 - 2015

N2 - 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 ⌈s/4⌉sn, then H can be tiled with copies of a loose cycle on s vertices. The co-degree condition is tight.

AB - 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 ⌈s/4⌉sn, then H can be tiled with copies of a loose cycle on s vertices. The co-degree condition is tight.

KW - Hypergraphs

KW - Loose cycles

UR - http://www.scopus.com/inward/record.url?scp=84949255569&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84949255569&partnerID=8YFLogxK

U2 - 10.1002/jgt.21998

DO - 10.1002/jgt.21998

M3 - Article

AN - SCOPUS:84949255569

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

ER -