\(k\)-sets and rectilinear crossings in complete uniform hypergraphs

DOI10.1016/j.comgeo.2019.101578zbMath1437.05171arXiv1806.02574OpenAlexW3102374399WikidataQ127096297 ScholiaQ127096297MaRDI QIDQ2173451

Rahul Gangopadhyay, Saswata Shannigrahi

Publication date: 22 April 2020

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

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

zbMATH Keywords

rectilinear crossing numberGale transform\(k\)-setbalanced lineaffine Gale diagram

Mathematics Subject Classification ID

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

Related Items (2)

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
• New results on lower bounds for the number of \((\leq k)\)-facets
• Extremal problems for geometric hypergraphs
• On the rectilinear crossing number of complete uniform hypergraphs
• Generalized sandwich theorems
• Lectures on Polytopes
• Convex Polytopes
• Foundations of Optimization
• On the number of balanced lines
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(k\)-sets and rectilinear crossings in complete uniform hypergraphs