Hypergraphs with No Cycle of a Given Length
From MaRDI portal
Publication:2883862
DOI10.1017/S0963548311000691zbMath1241.05101OpenAlexW2112297986MaRDI QIDQ2883862
Publication date: 14 May 2012
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548311000691
Related Items (41)
Turán numbers for hypergraph star forests ⋮ Large hypergraphs without tight cycles ⋮ Hypergraphs with no tight cycles ⋮ The Turán number of Berge-matching in hypergraphs ⋮ Generalized rainbow Turán problems ⋮ Multicolor Turán numbers ⋮ A note on the uniformity threshold for Berge hypergraphs ⋮ A note on the Tur\'an number of a Berge odd cycle ⋮ Forbidding \(K_{2,t}\) traces in triple systems ⋮ 3-uniform hypergraphs without a cycle of length five ⋮ Turán numbers of complete 3-uniform Berge-hypergraphs ⋮ On Berge-Ramsey problems ⋮ On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\) ⋮ Counting hypergraphs with large girth ⋮ Linearity of saturation for Berge hypergraphs ⋮ Induced Turán problems and traces of hypergraphs ⋮ Improved lower bounds for multiplicative square-free sequences ⋮ Some tight lower bounds for Turán problems via constructions of multi-hypergraphs ⋮ On \(3\)-uniform hypergraphs avoiding a cycle of length four ⋮ On Ramsey numbers of 3-uniform Berge cycles ⋮ Generalized Turán problems for even cycles ⋮ Extremal Results for Berge Hypergraphs ⋮ On Tight Cycles in Hypergraphs ⋮ $t$-Wise Berge and $t$-Heavy Hypergraphs ⋮ Turán problems and shadows. I: Paths and cycles ⋮ Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers ⋮ On the cover Turán number of Berge hypergraphs ⋮ On 3-uniform hypergraphs without a cycle of a given length ⋮ On Hamiltonian Berge cycles in [3-uniform hypergraphs] ⋮ Cycles of given lengths in hypergraphs ⋮ Relative Turán numbers for hypergraph cycles ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ Ramsey Problems for Berge Hypergraphs ⋮ Hypergraph based Berge hypergraphs ⋮ Asymptotics for the Turán number of Berge-\(K_{2,t}\) ⋮ Counting copies of a fixed subgraph in \(F\)-free graphs ⋮ On the cover Ramsey number of Berge hypergraphs ⋮ Generalized Turán problems for disjoint copies of graphs ⋮ On the weight of Berge-\(F\)-free hypergraphs ⋮ Generalized Turán problems for complete bipartite graphs ⋮ Multicolor Ramsey numbers for Berge cycles
Cites Work
This page was built for publication: Hypergraphs with No Cycle of a Given Length
