Saturation problems in convex geometric hypergraphs

DOI10.1016/j.ejc.2023.103702OpenAlexW3201392227MaRDI QIDQ2701003

Sam Spiro, Jason O'Neill

Publication date: 27 April 2023

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (05Cxx) Designs and configurations (05Bxx) Extremal combinatorics (05Dxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On convex geometric graphs with no \(k+1\) pairwise disjoint edges
• A survey of minimum saturated graphs
• More Turán-type theorems for triangles in convex point sets
• On maximal intersecting families of finite sets
• A Turán-type theorem on chords of a convex polygon
• Extremal theory for convex matchings in convex geometric graphs
• Extremal problems for pairs of triangles
• Ordered and convex geometric trees with linear extremal function
• On edge-colored saturation problems
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Rainbow Saturation and Graph Capacities
• Colored Saturation Parameters for Rainbow Subgraphs
• The Minimum Size of Saturated Hypergraphs
• Rainbow saturation of graphs
• Tight paths in convex geometric hypergraphs
• A Problem in Graph Theory
• The Beginnings of Geometric Graph Theory
• On generalized graphs

This page was built for publication: Saturation problems in convex geometric hypergraphs