Triangle-Free Hypergraphs

DOI10.1017/S0963548305007108zbMATH Open1082.05064OpenAlexW2068434995MaRDI QIDQ3373663FDOQ3373663

Authors: Ervin Győri 

Publication date: 13 March 2006

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548305007108

Recommendations

• Hypergraphs with no odd cycle of given length
• On 3-uniform hypergraphs without a cycle of a given length
• Hypergraphs with no tight cycles
• Pentagons vs. triangles
• 3-uniform hypergraphs avoiding a given odd cycle

zbMATH Keywords

boundscycle

Mathematics Subject Classification ID

Hypergraphs (05C65)

Cited In (36)

• Ramsey numbers of Berge-hypergraphs and related structures
• Turán numbers for hypergraph star forests
• Hypergraphs with no cycle of a given length
• Hypergraphs with no cycle of length 4
• Saturation of Berge hypergraphs
• Title not available (Why is that?)
• Exact bipartite Turán numbers of large even cycles
• A note on saturation for Berge-\(G\) hypergraphs
• Extremal results for Berge hypergraphs
• 3-uniform hypergraphs without a cycle of length five
• Large hypergraphs without tight cycles
• Title not available (Why is that?)
• \(t\)-wise Berge and \(t\)-heavy hypergraphs
• Book free 3-uniform hypergraphs
• 3-uniform hypergraphs avoiding a given odd cycle
• Counterexample to a conjecture of Györi on \(C_{2l}\)-free bipartite graphs
• Extremal problems for the \(p\)-spectral radius of Berge hypergraphs
• The extremal \(p\)-spectral radius of Berge hypergraphs
• On the weight of Berge-\(F\)-free hypergraphs
• On Ramsey numbers of 3-uniform Berge cycles
• Extremal numbers of hypergraph suspensions of even cycles
• A note on the Turán number of a Berge odd cycle
• Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs
• Hypergraph based Berge hypergraphs
• The Turán number of Berge book hypergraphs
• Rainbow even cycles
• Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs
• Some tight lower bounds for Turán problems via constructions of multi-hypergraphs
• Hypergraphs with no odd cycle of given length
• On tight cycles in hypergraphs
• On the cover Turán number of Berge hypergraphs
• The Turán Number of Berge K_4 in Triple Systems
• A note on Ramsey numbers for Berge-\(G\) hypergraphs
• Cycles of given lengths in hypergraphs
• Nearly-regular hypergraphs and saturation of Berge stars
• Codes with girth 8 Tanner graph representation

This page was built for publication: Triangle-Free Hypergraphs

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