Petruska's question on planar convex sets

DOI10.1016/j.disc.2020.111956zbMath1443.05133arXiv1912.08080OpenAlexW3029998997MaRDI QIDQ776273

Timothy J. Pervenecki, Adam S. Jobson, Géza Tóth, André E. Kézdy, Jenő Lehel

Publication date: 8 July 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

convex setsHelly's theoremset systems2-representable hypergraphsErdős's arrow problems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

The Szemerédi-Petruska conjecture for a few small values ⋮ The equivalence of the Szemerédi and Petruska conjecture and the maximum order of 3-uniform \(\tau\)-critical hypergraphs ⋮ Eckhoff's problem on convex sets in the plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). I: Necessity of Eckhoff's conditions
• Critical hypergraphs and interesting set-pair systems
• Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). II: Sufficiency of Eckhoff's conditions
• A generalization of Caratheodory's theorem
• Upper bound on the order of tau-critical hypergraphs
• d-collapsing and nerves of families of convex sets
• Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey
• A Theorem on k-Saturated Graphs
• On Certain Intersection Properties of Convex Sets

This page was built for publication: Petruska's question on planar convex sets