On the rectilinear crossing number of complete uniform hypergraphs

DOI10.1016/j.comgeo.2016.11.001zbMath1368.05106arXiv1512.01335OpenAlexW3102159402MaRDI QIDQ2362105

Anurag Anshu, Rahul Gangopadhyay, Saswata Shannigrahi, Satyanarayana Vusirikala

Publication date: 5 July 2017

Published in: Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

Gale transformcrossing simplicesmoment curveHam-Sandwich theorem

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

\(k\)-sets and rectilinear crossings in complete uniform hypergraphs ⋮ Rectilinear crossings in complete balanced \(d\)-partite \(d\)-uniform hypergraphs ⋮ Maximum rectilinear crossing number of uniform hypergraphs

Cites Work

• A lower bound on the crossing number of uniform hypergraphs
• On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\)
• Extremal problems for geometric hypergraphs
• The graph crossing number and its variants: a survey
• Primitive Radon partitions for cyclic polytopes
• Computational search of small point sets with small rectilinear crossing number
• Foundations of Optimization
• The maximum numbers of faces of a convex polytope
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the rectilinear crossing number of complete uniform hypergraphs