Hypergraphs with no odd cycle of given length

DOI10.1016/J.ENDM.2009.07.059MaRDI QIDQ2851489zbMATH OpenOpenAlexFDO

Authors Nathan Lemons, Ervin Győri

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

extremal graph theoryhypergraphsset systems

Mathematics Subject Classification ID

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

Recommendations

• 3-uniform hypergraphs avoiding a given odd cycle
• Hypergraphs with no cycle of a given length
• On 3-uniform hypergraphs without a cycle of a given length
• 3-uniform hypergraphs without a cycle of length five
• On hypergraphs of girth five

Cites work

• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 3285073 (Why is no real title available?)
• Cycles of even length in graphs
• Decomposition of Finite Graphs Into Forests
• On hypergraphs of girth five
• On maximal paths and circuits of graphs
• On the structure of linear graphs
• Pentagons vs. triangles
• The maximum number of triangles in \(C_{2k+1}\)-free graphs
• Triangle-Free Hypergraphs

Cited in

(12)

• Hypergraphs with no cycle of a given length
• Ramsey numbers for nontrivial Berge cycles
• Kernelization for cycle transversal problems
• Odd cycles and \(\Theta\)-cycles in hypergraphs
• 3-uniform hypergraphs avoiding a given odd cycle
• C-cycles in hypergraphs
• On \(3\)-uniform hypergraphs avoiding a cycle of length four
• A note on the Turán number of a Berge odd cycle
• Hypergraphs with no tight cycles
• Triangle-Free Hypergraphs
• On hypergraphs of girth five
• The structure of hypergraphs without long Berge cycles

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

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