Extremal problems for pairs of triangles

DOI10.1016/j.jctb.2022.02.003zbMath1487.05073arXiv2010.11100OpenAlexW4213448584MaRDI QIDQ2131860

Jason O'Neill, Dhruv Mubayi, Zoltan Fueredi, Jacques Verstraete

Publication date: 27 April 2022

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.11100

zbMATH Keywords

extremal hypergraphsintersecting planar triangle systemsordered triple systems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal set theory (05D05) Triple systems (05B07)

Related Items (1)

Saturation problems in convex geometric hypergraphs

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theorem
• On convex geometric graphs with no \(k+1\) pairwise disjoint edges
• Excluded permutation matrices and the Stanley-Wilf conjecture
• A new proof of the graph removal lemma
• More Turán-type theorems for triangles in convex point sets
• Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
• The maximum number of edges in geometric graphs with pairwise virtually avoiding edges
• Stabbing simplices by points and flats
• The number of triangles covering the center of an \(n\)-set
• A generalization of Caratheodory's theorem
• A Turán-type theorem on chords of a convex polygon
• On geometric graphs with no \(k\) pairwise parallel edges
• Geometric graphs with no self-intersecting path of length three
• Extremal theory for convex matchings in convex geometric graphs
• Ordered and convex geometric trees with linear extremal function
• Forbidden paths and cycles in ordered graphs and matrices
• A point in many triangles
• An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
• Extensions of the linear bound in the Füredi-Hajnal conjecture
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Tight paths in convex geometric hypergraphs
• The Beginnings of Geometric Graph Theory
• Triangles of extremal area or perimeter in a finite planar point set
• A continuous analogue of the upper bound theorem

This page was built for publication: Extremal problems for pairs of triangles