From art and circuit design to geometry and combinatorics
From MaRDI portal
Publication:6064580
Recommendations
Cites work
- scientific article; zbMATH DE number 3172297 (Why is no real title available?)
- scientific article; zbMATH DE number 2145237 (Why is no real title available?)
- scientific article; zbMATH DE number 3258070 (Why is no real title available?)
- scientific article; zbMATH DE number 3404259 (Why is no real title available?)
- 3-symmetric and 3-decomposable geometric drawings of \(K_n\)
- Closing in on Hill's conjecture
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- Drawings of complete graphs in the projective plane
- Flag algebras
- Large networks and graph limits
- New lower bound techniques for VLSI
- On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\)
- On a problem of P. Turan concerning graphs
- On the Distribution of Crossings in Random Complete Graphs
- Shellable drawings and the cylindrical crossing number of \(K_n\)
- Simultaneous arithmetic progressions on algebraic curves
- The 2-page crossing number of \(K_{n}\)
- The Historical Development of J. J. Sylvester's Four Point Problem
- The Rectilinear Crossing Number of a Complete Graph and Sylvester's "Four Point Problem" of Geometric Probability
- The crossing number of K11 is 100
- The graph crossing number and its variants: a survey
- The toroidal crossing number of the complete graph
- Unsolved problems in geometry
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)