3-uniform hypergraphs avoiding a given odd cycle

DOI10.1007/S00493-012-2584-4MaRDI QIDQ452824zbMATH OpenOpenAlexFDO

Authors Nathan Lemons, Ervin Győri

Publication date 17 September 2012

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-012-2584-4

zbMATH Keywords

3-uniform hypergrahpsavoidinig odd cycleBerge cycle

Mathematics Subject Classification ID

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

Recommendations

• Hypergraphs with no odd cycle of given length
• 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
• Hypergraphs with no tight cycles

Cites work

• 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
• Triangle-Free Hypergraphs

Cited in

(41)

• Nearly-regular hypergraphs and saturation of Berge stars
• Turán problems for Berge-\((k, p)\)-fan hypergraph
• An Erdős-Gallai type theorem for vertex colored graphs
• Turán numbers for hypergraph star forests
• Hypergraphs with no cycle of a given length
• Saturation of Berge hypergraphs
• Ramsey numbers for nontrivial Berge cycles
• On 3-uniform hypergraphs without linear cycles
• Multicolor Ramsey numbers for Berge cycles
• Extremal results for Berge hypergraphs
• 3-uniform hypergraphs without a cycle of length five
• Odd cycles and \(\Theta\)-cycles in hypergraphs
• Turán problems and shadows. I: Paths and cycles
• Generalized Turán problems for even cycles
• On the weight of Berge-\(F\)-free hypergraphs
• Forbidding \(K_{2,t}\) traces in triple systems
• On \(3\)-uniform hypergraphs avoiding a cycle of length four
• Hypergraphs with Few Berge Paths of Fixed Length between Vertices
• A note on the Turán number of a Berge odd cycle
• On the cover Ramsey number of Berge hypergraphs
• On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\)
• Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs
• Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs
• Hypergraphs with no tight cycles
• Triangle-Free Hypergraphs
• Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
• Hypergraphs with no odd cycle of given length
• General lemmas for Berge-Turán hypergraph problems
• On tight cycles in hypergraphs
• On the cover Turán number of Berge hypergraphs
• Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
• The Turán Number of Berge K_4 in Triple Systems
• Asymptotics for the Turán number of Berge-\(K_{2,t}\)
• Turán numbers of complete 3-uniform Berge-hypergraphs
• Induced Turán problems and traces of hypergraphs
• Improved lower bounds for multiplicative square-free sequences
• On 3-uniform hypergraphs without a cycle of a given length
• On hypergraphs of girth five
• Anti-Ramsey numbers of paths and cycles in hypergraphs
• Cycles of given lengths in hypergraphs
• On Hamiltonian Berge cycles in [3]-uniform hypergraphs

This page was built for publication: 3-uniform hypergraphs avoiding a given odd cycle

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