Even cycles in hypergraphs

DOI10.1016/J.JCTB.2004.12.004MaRDI QIDQ1775899zbMATH OpenOpenAlexFDO

Authors Alexandr Kostochka, J. Verstraëte

Publication date 4 May 2005

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jctb.2004.12.004

zbMATH Keywords

hypertree

Mathematics Subject Classification ID

Paths and cycles (05C38) Hypergraphs (05C65)

Review text

This paper determines the possible maximum number of (not necessarily distinct) edges in an \(n\)-vertices hypergraph without even cycles.

Cited in

(8)

• Hypergraphs with no cycle of a given length
• scientific article; zbMATH DE number 3929049 (Why is no real title available?)
• Even Cycles in Directed Graphs
• The extremal function for cycles of length \(\ell\) mod \(k\)
• On even-cycle-free subgraphs of the hypercube
• On even-cycle-free subgraphs of the hypercube
• Exact bipartite Turán numbers of large even cycles
• Linear three-uniform hypergraphs with no Berge path of given length

This page was built for publication: Even cycles in hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1775899)