On the Distribution of Crossings in Random Complete Graphs
From MaRDI portal
Cited in
(15)- Shellable drawings and the cylindrical crossing number of \(K_n\)
- Extending drawings of complete graphs into arrangements of pseudocircles
- Limiting Crossing Numbers for Geodesic Drawings on the Sphere
- Edge crossings in random linear arrangements
- Closing in on Hill's conjecture
- Turán's brick factory problem: the status of the conjectures of Zarankiewicz and Hill
- scientific article; zbMATH DE number 3333192 (Why is no real title available?)
- Reappraising the distribution of the number of edge crossings of graphs on a sphere
- From art and circuit design to geometry and combinatorics
- Drawings of complete graphs in the projective plane
- Central limit theorem for crossings in randomly embedded graphs
- On the number of crossings in a random labeled tree
- Limit theorems for the number of crossings and stress in projections of a random geometric graph
- Levels in arrangements: linear relations, the g-matrix, and applications to crossing numbers
- An algorithm for estimating the crossing number of dense graphs, and continuous analogs of the crossing and rectilinear crossing numbers
This page was built for publication: On the Distribution of Crossings in Random Complete Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5342301)