The Turán Number of Berge K_4 in Triple Systems
From MaRDI portal
Publication:4627478
DOI10.1137/18M1204048zbMath1406.05050arXiv1807.11211MaRDI QIDQ4627478
Publication date: 11 March 2019
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.11211
Related Items (7)
The Turán number of Berge-matching in hypergraphs ⋮ 3-uniform hypergraphs without a cycle of length five ⋮ The Turán number of Berge hypergraphs with stable properties ⋮ Induced Turán problems and traces of hypergraphs ⋮ On Ramsey numbers of 3-uniform Berge cycles ⋮ The Turán Number of Berge-$K_4$ in 3-Uniform Hypergraphs ⋮ Ramsey numbers of Berge-hypergraphs and related structures
Cites Work
- 3-uniform hypergraphs avoiding a given odd cycle
- On 3-uniform hypergraphs without a cycle of a given length
- A note on Ramsey numbers for Berge-\(G\) hypergraphs
- Exact computation of the hypergraph Turán function for expanded complete 2-graphs
- General lemmas for Berge-Turán hypergraph problems
- Turán numbers for Berge-hypergraphs and related extremal problems
- Avoiding long Berge cycles
- Asymptotics for the Turán number of Berge-\(K_{2,t}\)
- Counting copies of a fixed subgraph in \(F\)-free graphs
- Turán numbers of complete 3-uniform Berge-hypergraphs
- A hypergraph extension of Turán's theorem
- Hypergraph Extensions of the Erdős-Gallai Theorem
- A survey of Turán problems for expansions
- Triangle-Free Hypergraphs
- Extremal Results for Berge Hypergraphs
- Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs
- Many \(T\) copies in \(H\)-free graphs
This page was built for publication: The Turán Number of Berge K_4 in Triple Systems
