Extremal Results for Berge Hypergraphs
From MaRDI portal
Publication:5371028
DOI10.1137/16M1066191zbMath1372.05106arXiv1505.08127MaRDI QIDQ5371028
Publication date: 24 October 2017
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.08127
Related Items (57)
On saturation of Berge hypergraphs ⋮ Turán numbers for hypergraph star forests ⋮ The Turán number of Berge-matching in hypergraphs ⋮ A note on the uniformity threshold for Berge hypergraphs ⋮ Spectral Radius on Linear $r$-Graphs without Expanded $K_{r+1}$ ⋮ A note on the Tur\'an number of a Berge odd cycle ⋮ A note on the maximum size of Berge-\( C_4\)-free hypergraphs ⋮ Forbidding \(K_{2,t}\) traces in triple systems ⋮ Extremal problems for the \(p\)-spectral radius of Berge hypergraphs ⋮ 3-uniform hypergraphs without a cycle of length five ⋮ On Berge-Ramsey problems ⋮ On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\) ⋮ The Turán number of Berge hypergraphs with stable properties ⋮ Linearity of saturation for Berge hypergraphs ⋮ Induced Turán problems and traces of hypergraphs ⋮ On non-degenerate Berge-Turán problems ⋮ Some tight lower bounds for Turán problems via constructions of multi-hypergraphs ⋮ On Ramsey numbers of 3-uniform Berge cycles ⋮ Saturation numbers for Berge cliques ⋮ Generalized Turán problems for even cycles ⋮ Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs ⋮ $t$-Wise Berge and $t$-Heavy Hypergraphs ⋮ Saturation number of Berge stars in random hypergraphs ⋮ The Turán Number of Berge-$K_4$ in 3-Uniform Hypergraphs ⋮ The Turán Number of Berge K_4 in Triple Systems ⋮ A linear hypergraph extension of the bipartite Turán problem ⋮ 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 ⋮ General lemmas for Berge-Turán hypergraph problems ⋮ Forbidden Berge hypergraphs ⋮ Turán numbers for Berge-hypergraphs and related extremal problems ⋮ Saturation of Berge hypergraphs ⋮ A note on saturation for Berge-\(G\) hypergraphs ⋮ 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 ⋮ On Hamiltonian Berge cycles in [3-uniform hypergraphs] ⋮ Exponential lower bound for Berge-Ramsey problems ⋮ Hypergraph extensions of the Erdős-Gallai theorem ⋮ Turán problems for Berge-\((k, p)\)-fan hypergraph ⋮ Ramsey Problems for Berge Hypergraphs ⋮ Spectral extremal results for hypergraphs ⋮ Hypergraph based Berge hypergraphs ⋮ Avoiding long Berge cycles ⋮ Asymptotics for the Turán number of Berge-\(K_{2,t}\) ⋮ Unified approach to the generalized Turán problem and supersaturation ⋮ Hypergraphs with Few Berge Paths of Fixed Length between Vertices ⋮ Counting copies of a fixed subgraph in \(F\)-free graphs ⋮ Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2 ⋮ On the cover Ramsey number of Berge hypergraphs ⋮ Partitioning the power set of \([n\) into \(C_k\)-free parts] ⋮ 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 ⋮ A linear hypergraph extension of Turán's theorem
Cites Work
- Unnamed Item
- Turán problems and shadows. II: Trees
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
- Hypergraphs with no cycle of length 4
- 3-uniform hypergraphs avoiding a given odd cycle
- Turán problems and shadows. I: Paths and cycles
- On 3-uniform hypergraphs without a cycle of a given length
- Hypergraph extensions of the Erdős-Gallai theorem
- Pentagons vs. triangles
- On hypergraphs of girth five
- An Erdős-Gallai type theorem for uniform hypergraphs
- Cycles of even length in graphs
- Hypergraph Turán numbers of linear cycles
- Linear trees in uniform hypergraphs
- Hypergraphs with No Cycle of a Given Length
- On maximal paths and circuits of graphs
- Triangle-Free Hypergraphs
- Rainbow Turán Problems
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- Anti-Ramsey theory on complete bipartite graphs
- Turán Problems and Shadows III: Expansions of Graphs
- On a problem of K. Zarankiewicz
- An anti-Ramsey theorem
This page was built for publication: Extremal Results for Berge Hypergraphs
