A hypergraph extension of the bipartite Turán problem
From MaRDI portal
Publication:1826942
DOI10.1016/j.jcta.2004.02.002zbMath1045.05019OpenAlexW2029485128MaRDI QIDQ1826942
Dhruv Mubayi, Jacques Verstraete
Publication date: 6 August 2004
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2004.02.002
Related Items (16)
Minimal paths and cycles in set systems ⋮ An intersection theorem for four sets ⋮ Some extremal results on hypergraph Turán problems ⋮ A generalization of the K\H{o}v\'{a}ri-S\'{o}s-Tur\'{a}n theorem ⋮ Finding a minimal spanning hypertree of a weighted hypergraph ⋮ Two-regular subgraphs of odd-uniform hypergraphs ⋮ New bounds for a hypergraph bipartite Turán problem ⋮ Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles ⋮ Some tight lower bounds for Turán problems via constructions of multi-hypergraphs ⋮ Turán problems and shadows. I: Paths and cycles ⋮ Relative Turán numbers for hypergraph cycles ⋮ The maximum size of hypergraphs without generalized 4-cycles ⋮ Two-regular subgraphs of hypergraphs ⋮ Structure and stability of triangle-free set systems ⋮ Turán Problems and Shadows III: Expansions of Graphs ⋮ Finding the shortest path for a Hypergraph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hypergraphs in which all disjoint pairs have distinct unions
- Norm-graphs: Variations and applications
- New asymptotics for bipartite Turán numbers
- Norm-graphs and bipartite Turán numbers
- Some Exact Results and New Asymptotics for Hypergraph Turán Numbers
- On coloring graphs to maximize the proportion of multicolored k-edges
- On a problem of K. Zarankiewicz
This page was built for publication: A hypergraph extension of the bipartite Turán problem
