Forbidding \(K_{2,t}\) traces in triple systems
From MaRDI portal
Publication:2662345
DOI10.37236/9760zbMath1461.05234arXiv2007.01827OpenAlexW3153158565MaRDI QIDQ2662345
Publication date: 12 April 2021
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.01827
Hypergraphs (05C65) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal combinatorics (05D99)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 3-uniform hypergraphs avoiding a given odd cycle
- On 3-uniform hypergraphs without a cycle of a given length
- Pentagons vs. triangles
- Cycles of even length in graphs
- New asymptotics for bipartite Turán numbers
- General lemmas for Berge-Turán hypergraph problems
- Asymptotics for the Turán number of Berge-\(K_{2,t}\)
- Forbidden families of minimal quadratic and cubic configurations
- Forbidding complete hypergraphs as traces
- A note on the maximum size of Berge-\( C_4\)-free hypergraphs
- Hypergraphs with No Cycle of a Given Length
- 3-Uniform Hypergraphs and Linear Cycles
- Extremal Results for Berge Hypergraphs
- On Graphs that do not Contain a Thomsen Graph
- On a problem of K. Zarankiewicz
- On the structure of linear graphs
- Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs
- Many \(T\) copies in \(H\)-free graphs
