Even cycles in hypergraphs

Alexandr Kostochka, Jacques Verstraëte

Research output: Contribution to journalArticlepeer-review


A cycle in a hypergraph is an alternating cyclic sequence A0, v0, A1, v1,..., Ak-1, vk-1, A0 of distinct edges Ai and vertices vi such that vi ∈ Ai ∩ Ai+1 for all i modulo k. In this paper, we determine the maximum number of edges in hypergraphs on n vertices containing no even cycles.

Original languageEnglish (US)
Pages (from-to)173-182
Number of pages10
JournalJournal of Combinatorial Theory. Series B
Issue number1
StatePublished - May 2005


  • Cycle
  • Hypergraph
  • Hypertree

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'Even cycles in hypergraphs'. Together they form a unique fingerprint.

Cite this