From art and circuit design to geometry and combinatorics

DOI10.4171/8ECM/37MaRDI QIDQ6064580zbMATH OpenFDO

Authors Bojan Mohar

Publication date 10 November 2023

Published in European Congress of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4171/8ECM/37

zbMATH Keywords

crossing numbergeodesic drawinggraph drawing

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Erd?s problems and related topics of discrete geometry (52C10)

Review text

Summary: These notes provide a detailed insight on the interplay between crossing numbers of graphs and random geodesic drawings, and try to explain a relationship with the main fundamental open questions about crossing numbers of graphs. A very general class of geodesic drawings on the sphere attaining the Hill bound is presented. For the entire collection see [Zbl 1519.00033].

Recommendations

• Do we really understand the crossing numbers?
• Crossing numbers
• Crossing numbers of graphs
• Drawings of complete graphs in the projective plane
• Toward the rectilinear crossing number of \(K _{n}\): New drawings, upper bounds, and asymptotics

Cites work

• 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
• 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?)
• 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 crossing number of K₁₁ is 100
• The graph crossing number and its variants: a survey
• 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 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)