Maximum rectilinear crossing number of uniform hypergraphs
DOI10.1007/s00373-023-02711-2zbMath1525.05139arXiv1908.04654OpenAlexW3101988762MaRDI QIDQ6083186
Publication date: 31 October 2023
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.04654
rectilinear crossing numberorder typeneighborly polytopegale transformcomplete uniform hypergraphs\(d\)-partite \(d\)-uniform hypergraphs
Extremal problems in graph theory (05C35) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Hypergraphs (05C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A lower bound on the crossing number of uniform hypergraphs
- On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\)
- On the obfuscation complexity of planar graphs
- Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
- A generalization of Caratheodory's theorem
- Some Erdős-Szekeres type results about points in space
- Extremal problems for geometric hypergraphs
- Enumerating order types for small point sets with applications
- The graph crossing number and its variants: a survey
- \(k\)-sets and rectilinear crossings in complete uniform hypergraphs
- Rectilinear crossings in complete balanced \(d\)-partite \(d\)-uniform hypergraphs
- On the rectilinear crossing number of complete uniform hypergraphs
- New lower bounds for the number of \((\leq k)\)-edges and the rectilinear crossing number of \(K_{n}\)
- Primitive Radon partitions for cyclic polytopes
- Approximating the Maximum Rectilinear Crossing Number
- The Rectilinear Crossing Number of K n : Closing in (or Are We?)
- Lectures on Polytopes
- Convex Polytopes
- On the Maximum Crossing Number
- An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants
- The maximum numbers of faces of a convex polytope
- A continuous analogue of the upper bound theorem
This page was built for publication: Maximum rectilinear crossing number of uniform hypergraphs
