Extremal problems for convex geometric hypergraphs and ordered hypergraphs
From MaRDI portal
Publication:5021260
DOI10.4153/S0008414X20000632zbMath1480.05100arXiv1906.04575OpenAlexW3048947901MaRDI QIDQ5021260
Tao Jiang, Dhruv Mubayi, Jacques Verstraete, Alexandr V. Kostochka, Zoltan Fueredi
Publication date: 12 January 2022
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.04575
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05) Erd?s problems and related topics of discrete geometry (52C10)
Related Items (3)
Tilings in vertex ordered graphs ⋮ Helly-type theorems for the ordering of the vertices of a hypergraph ⋮ Partitioning ordered hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Excluded permutation matrices and the Stanley-Wilf conjecture
- More Turán-type theorems for triangles in convex point sets
- A Turán-type theorem on chords of a convex polygon
- Extremal theory for convex matchings in convex geometric graphs
- Partitioning ordered hypergraphs
- Ordered and convex geometric trees with linear extremal function
- Forbidden paths and cycles in ordered graphs and matrices
- How Many Unit Equilateral Triangles Can Be Generated by N Points in Convex Position?
- Tight paths in convex geometric hypergraphs
- On coloring graphs to maximize the proportion of multicolored k-edges
- On the Turán number of ordered forests
- Triangles of extremal area or perimeter in a finite planar point set
This page was built for publication: Extremal problems for convex geometric hypergraphs and ordered hypergraphs
