Hamilton l-cycles in uniform hypergraphs

Daniela Kuhn; Richard Mycroft; Deryk Osthus

doi:10.1016/j.jcta.2010.02.010

Hamilton l-cycles in uniform hypergraphs

Daniela Kuhn, Richard Mycroft, Deryk Osthus

Mathematics

Research output: Contribution to journal › Article › peer-review

41 Citations (Scopus)

Abstract

We say that a k-uniform hypergraph C is an l-cycle if there exists a cyclic ordering of the vertices of C such that every edge of C consists of k consecutive vertices and such that every pair of consecutive edges (in the natural ordering of the edges) intersects in precisely l vertices. We prove that if 1

Original language	English
Pages (from-to)	910-927
Number of pages	18
Journal	Journal of Combinatorial Theory, Series A
Volume	117
Issue number	7
DOIs	https://doi.org/10.1016/j.jcta.2010.02.010
Publication status	Published - 1 Oct 2010

Keywords

Hamilton cycles
Regularity lemma
Hypergraphs

Access to Document

10.1016/j.jcta.2010.02.010

Graph expansion and applications
Osthus, D. (Principal Investigator)
Engineering & Physical Science Research Council
1/08/07 → 30/11/09
Project: Research Councils
Probabilistic Methods in Graph Theory
Kuhn, D. (Principal Investigator) & Osthus, D. (Co-Investigator)
Engineering & Physical Science Research Council
26/04/06 → 25/01/09
Project: Research Councils

Cite this

@article{62b0cd93981d4ad2bc869d7b9939cad2,

title = "Hamilton l-cycles in uniform hypergraphs",

abstract = "We say that a k-uniform hypergraph C is an l-cycle if there exists a cyclic ordering of the vertices of C such that every edge of C consists of k consecutive vertices and such that every pair of consecutive edges (in the natural ordering of the edges) intersects in precisely l vertices. We prove that if 1 ",

keywords = "Hamilton cycles, Regularity lemma, Hypergraphs",

author = "Daniela Kuhn and Richard Mycroft and Deryk Osthus",

year = "2010",

month = oct,

day = "1",

doi = "10.1016/j.jcta.2010.02.010",

language = "English",

volume = "117",

pages = "910--927",

journal = "Journal of Combinatorial Theory, Series A",

publisher = "Elsevier",

number = "7",

}

TY - JOUR

T1 - Hamilton l-cycles in uniform hypergraphs

AU - Kuhn, Daniela

AU - Mycroft, Richard

AU - Osthus, Deryk

PY - 2010/10/1

Y1 - 2010/10/1

N2 - We say that a k-uniform hypergraph C is an l-cycle if there exists a cyclic ordering of the vertices of C such that every edge of C consists of k consecutive vertices and such that every pair of consecutive edges (in the natural ordering of the edges) intersects in precisely l vertices. We prove that if 1

AB - We say that a k-uniform hypergraph C is an l-cycle if there exists a cyclic ordering of the vertices of C such that every edge of C consists of k consecutive vertices and such that every pair of consecutive edges (in the natural ordering of the edges) intersects in precisely l vertices. We prove that if 1

KW - Hamilton cycles

KW - Regularity lemma

KW - Hypergraphs

U2 - 10.1016/j.jcta.2010.02.010

DO - 10.1016/j.jcta.2010.02.010

M3 - Article

VL - 117

SP - 910

EP - 927

JO - Journal of Combinatorial Theory, Series A

JF - Journal of Combinatorial Theory, Series A

IS - 7

ER -

Hamilton l-cycles in uniform hypergraphs

Abstract

Keywords

Access to Document

Fingerprint

Projects

Graph expansion and applications

Probabilistic Methods in Graph Theory

Cite this