Crossing numbers of random graphs
From MaRDI portal
Recommendations
- Crossing numbers and stress of random graphs
- Crossing numbers of graphs
- scientific article; zbMATH DE number 2145247
- Crossing numbers of Sierpiński‐like graphs
- The Crossing Number of Graphs: Theory and Computation
- \(k\)-planar crossing number of random graphs and random regular graphs
- Survey of the crossing number of graphs
- Publication:4729111
- On the crossing number of complete graphs
Cites work
- A Separator Theorem for Planar Graphs
- Applications of the crossing number
- Bisecting sparse random graphs
- Bounds for rectilinear crossing numbers
- Concentration of multivariate polynomials and its applications
- Counting extensions
- scientific article; zbMATH DE number 1452728 (Why is no real title available?)
- scientific article; zbMATH DE number 4182820 (Why is no real title available?)
- Nearly perfect matchings in regular simple hypergraphs
- New lower bound techniques for VLSI
- Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
- The number of polytopes, configurations and real matroids
- Toward the rectilinear crossing number of \(K _{n}\): New drawings, upper bounds, and asymptotics
- Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
- Weighted sums of certain dependent random variables
- Which crossing number is it anyway?
Cited in
(20)- Analogies between the crossing number and the tangle crossing number
- \(k\)-planar crossing number of random graphs and random regular graphs
- Crossing numbers and stress of random graphs
- Crossing number, pair-crossing number, and expansion
- Approximating the rectilinear crossing number
- Expected crossing numbers
- Expected crossing numbers
- Space crossing numbers
- Smoothed Analysis on Connected Graphs
- Approximating the rectilinear crossing number
- On the decay of crossing numbers of sparse graphs
- scientific article; zbMATH DE number 2145247 (Why is no real title available?)
- Edge crossings in random linear arrangements
- Space crossing numbers
- Reappraising the distribution of the number of edge crossings of graphs on a sphere
- Counting extensions revisited
- 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
- 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: Crossing numbers of random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4798172)
