Triangle-Free Hypergraphs
From MaRDI portal
Publication:3373663
DOI10.1017/S0963548305007108zbMath1082.05064OpenAlexW2068434995MaRDI QIDQ3373663
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
Related Items (33)
Hypergraphs with No Cycle of a Given Length ⋮ Turán numbers for hypergraph star forests ⋮ Nearly-Regular Hypergraphs and Saturation of Berge Stars ⋮ Large hypergraphs without tight cycles ⋮ Codes with girth 8 Tanner graph representation ⋮ A note on the Tur\'an number of a Berge 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 ⋮ 3-uniform hypergraphs without a cycle of length five ⋮ Exact bipartite Turán numbers of large even cycles ⋮ Hypergraphs with no cycle of length 4 ⋮ Book free 3-uniform hypergraphs ⋮ Some tight lower bounds for Turán problems via constructions of multi-hypergraphs ⋮ On Ramsey numbers of 3-uniform Berge cycles ⋮ Extremal Results for Berge Hypergraphs ⋮ On Tight Cycles in Hypergraphs ⋮ 3-uniform hypergraphs avoiding a given odd cycle ⋮ $t$-Wise Berge and $t$-Heavy Hypergraphs ⋮ The Turán Number of Berge K_4 in Triple Systems ⋮ The extremal \(p\)-spectral radius of Berge hypergraphs ⋮ A note on Ramsey numbers for Berge-\(G\) hypergraphs ⋮ On the cover Turán number of Berge hypergraphs ⋮ Saturation of Berge hypergraphs ⋮ A note on saturation for Berge-\(G\) hypergraphs ⋮ Rainbow even cycles ⋮ Ramsey numbers of Berge-hypergraphs and related structures ⋮ Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs ⋮ Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs ⋮ Cycles of given lengths in hypergraphs ⋮ The Turán number of Berge book hypergraphs ⋮ Hypergraph based Berge hypergraphs ⋮ On the weight of Berge-\(F\)-free hypergraphs ⋮ Hypergraphs with no odd cycle of given length
This page was built for publication: Triangle-Free Hypergraphs
