Triangle-Free Hypergraphs
From MaRDI portal
Publication:3373663
Recommendations
Cited in
(36)- Turán numbers for hypergraph star forests
- Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs
- Hypergraph based Berge hypergraphs
- 3-uniform hypergraphs without a cycle of length five
- Counterexample to a conjecture of Györi on \(C_{2l}\)-free bipartite graphs
- On the weight of Berge-\(F\)-free hypergraphs
- A note on the Turán number of a Berge odd cycle
- A note on saturation for Berge-\(G\) hypergraphs
- \(t\)-wise Berge and \(t\)-heavy hypergraphs
- Hypergraphs with no odd cycle of given length
- A note on Ramsey numbers for Berge-\(G\) hypergraphs
- Extremal numbers of hypergraph suspensions of even cycles
- The Turán number of Berge book hypergraphs
- Rainbow even cycles
- Hypergraphs with no cycle of length 4
- Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs
- Nearly-regular hypergraphs and saturation of Berge stars
- Book free 3-uniform hypergraphs
- The Turán Number of Berge K_4 in Triple Systems
- Extremal problems for the \(p\)-spectral radius of Berge hypergraphs
- scientific article; zbMATH DE number 1496606 (Why is no real title available?)
- On Ramsey numbers of 3-uniform Berge cycles
- Ramsey numbers of Berge-hypergraphs and related structures
- Large hypergraphs without tight cycles
- On the cover Turán number of Berge hypergraphs
- Some tight lower bounds for Turán problems via constructions of multi-hypergraphs
- Codes with girth 8 Tanner graph representation
- Extremal results for Berge hypergraphs
- scientific article; zbMATH DE number 5139441 (Why is no real title available?)
- Cycles of given lengths in hypergraphs
- 3-uniform hypergraphs avoiding a given odd cycle
- On tight cycles in hypergraphs
- Hypergraphs with no cycle of a given length
- Exact bipartite Turán numbers of large even cycles
- The extremal \(p\)-spectral radius of Berge hypergraphs
- Saturation of Berge hypergraphs
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)