Partitioning ordered hypergraphs
From MaRDI portal
Publication:2005178
DOI10.1016/j.jcta.2020.105300zbMath1448.05161arXiv1906.03342OpenAlexW3047189704MaRDI QIDQ2005178
Tao Jiang, Dhruv Mubayi, Zoltan Fueredi, Alexandr V. Kostochka, Jacques Verstraete
Publication date: 7 October 2020
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.03342
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (1)
Cites Work
- Unnamed Item
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Forbidden submatrices
- Exact solution of some Turán-type problems
- Davenport-Schinzel theory of matrices
- The junta method in extremal hypergraph theory and Chvátal's conjecture
- The maximum number of unit distances in a convex \(n\)-gon
- A survey of forbidden configuration results
- New results on simplex-clusters in set systems
- Proof of a conjecture of Erdős on triangles in set-systems
- Forbidden paths and cycles in ordered graphs and matrices
- On 0-1 matrices and small excluded submatrices
- Extensions of the linear bound in the Füredi-Hajnal conjecture
- A survey of Turán problems for expansions
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- An Extremal Problem on Sparse 0-1 Matrices
- An Extremal Set-Intersection Theorem
- Extremal problems for convex geometric hypergraphs and ordered hypergraphs
- Tight paths in convex geometric hypergraphs
- On coloring graphs to maximize the proportion of multicolored k-edges
This page was built for publication: Partitioning ordered hypergraphs
