Hypergraphs with no odd cycle of given length

DOI10.1016/j.endm.2009.07.059zbMath1273.05157OpenAlexW2020435000MaRDI QIDQ2851489

Nathan Lemons, Ervin Gyoeri

Publication date: 10 October 2013

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

Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.059

zbMATH Keywords

hypergraphsextremal graph theoryset systems

Mathematics Subject Classification ID

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

Related Items (3)

Kernelization for cycle transversal problems ⋮ On \(3\)-uniform hypergraphs avoiding a cycle of length four ⋮ Ramsey Numbers for Nontrivial Berge Cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Pentagons vs. triangles
• On hypergraphs of girth five
• Cycles of even length in graphs
• The Maximum Number of Triangles in C_2k+1-Free Graphs
• On maximal paths and circuits of graphs
• Triangle-Free Hypergraphs
• Decomposition of Finite Graphs Into Forests
• On the structure of linear graphs

This page was built for publication: Hypergraphs with no odd cycle of given length