A lower bound on the crossing number of uniform hypergraphs
From MaRDI portal
Publication:298946
DOI10.1016/j.dam.2015.10.009zbMath1339.05267arXiv1309.3625OpenAlexW1957208143MaRDI QIDQ298946
Saswata Shannigrahi, Anurag Anshu
Publication date: 21 June 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.3625
Related Items (4)
On the rectilinear crossing number of complete uniform hypergraphs ⋮ \(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
- Unnamed Item
- Unnamed Item
- On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\)
- Geometric drawings of \(K_{n}\) with few crossings
- The Rectilinear Crossing Number of K n : Closing in (or Are We?)
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
This page was built for publication: A lower bound on the crossing number of uniform hypergraphs
