From art and circuit design to geometry and combinatorics
From MaRDI portal
Publication:6064580
DOI10.4171/8ECM/37zbMATH Open1526.05105MaRDI QIDQ6064580FDOQ6064580
Publication date: 10 November 2023
Published in: European Congress of Mathematics (Search for Journal in Brave)
Graph representations (geometric and intersection representations, etc.) (05C62) Erd?s problems and related topics of discrete geometry (52C10)
Cites Work
- Title not available (Why is that?)
- Flag algebras
- Unsolved problems in geometry
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- The graph crossing number and its variants: a survey
- 3-symmetric and 3-decomposable geometric drawings of \(K_n\)
- On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\)
- Title not available (Why is that?)
- New lower bound techniques for VLSI
- SIMULTANEOUS ARITHMETIC PROGRESSIONS ON ALGEBRAIC CURVES
- On a problem of P. Turan concerning graphs
- Shellable drawings and the cylindrical crossing number of \(K_n\)
- The crossing number of K11 is 100
- The Historical Development of J. J. Sylvester's Four Point Problem
- Title not available (Why is that?)
- The toroidal crossing number of the complete graph
- Title not available (Why is that?)
- The Rectilinear Crossing Number of a Complete Graph and Sylvester's "Four Point Problem" of Geometric Probability
- The 2-page crossing number of \(K_{n}\)
- Closing in on Hill's Conjecture
- On the Distribution of Crossings in Random Complete Graphs
- Drawings of complete graphs in the projective plane
- Title not available (Why is that?)
This page was built for publication: From art and circuit design to geometry and combinatorics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6064580)