Extremal Problems for Hypergraph Blowups of Trees
From MaRDI portal
Publication:6057807
DOI10.1137/22m1543318zbMath1525.05096arXiv2003.00622OpenAlexW3007733457MaRDI QIDQ6057807
Dhruv Mubayi, Alexandr V. Kostochka, Zoltan Fueredi, Jacques Verstraete, Tao Jiang
Publication date: 26 October 2023
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.00622
Trees (05C05) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Enumeration in graph theory (05C30) Paths and cycles (05C38)
Cites Work
- Unnamed Item
- Unnamed Item
- Turán problems and shadows. II: Trees
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
- Turán problems and shadows. I: Paths and cycles
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters
- Hypergraphs in which all disjoint pairs have distinct unions
- On finite set-systems whose every intersection is a kernel of a star
- The maximum size of hypergraphs without generalized 4-cycles
- Forbidding just one intersection
- Exact solution of some Turán-type problems
- Path Ramsey numbers in multicolorings
- Asymptotic solution of a Turán-type problem
- A survey of Turán problems for expansions
- On maximal paths and circuits of graphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On families of finite sets no two of which intersect in a singleton
- Intersection Properties of Systems of Finite Sets
- Tight paths in convex geometric hypergraphs
- Set Systems with No Singleton Intersection
- On intersecting families of finite sets
- Asymptotics of the hypergraph bipartite Turán problem
This page was built for publication: Extremal Problems for Hypergraph Blowups of Trees
