Odd cycles and \(\Theta\)-cycles in hypergraphs

DOI10.1016/J.DISC.2005.12.037zbMath1103.05056OpenAlexW2149551610MaRDI QIDQ2433709

André E. Kézdy, Michael S. Jacobson, Jenő Lehel, András Gyárfás

Publication date: 30 October 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.12.037

zbMATH Keywords

bipartite graphextremal problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Paths and cycles (05C38)

Related Items (3)

Hypergraphs with No Cycle of a Given Length ⋮ Stability and venture structures in multilateral matching ⋮ The extremal function for cycles of length \(\ell\) mod \(k\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of hypergraphs satisfying an inequality of Lovasz
• On a Class of Totally Unimodular Matrices
• Minimally 2-connected graphs.
• On Minimal Blocks

This page was built for publication: Odd cycles and \(\Theta\)-cycles in hypergraphs