Limiting crossing numbers for geodesic drawings on the sphere

08/24/2020
by   Marthe Bonamy, et al.
0

We introduce a model for random geodesic drawings of the complete bipartite graph K_n,n on the unit sphere 𝕊^2 in ℝ^3, where we select the vertices in each bipartite class of K_n,n with respect to two non-degenerate probability measures on 𝕊^2. It has been proved recently that many such measures give drawings whose crossing number approximates the Zarankiewicz number (the conjectured crossing number of K_n,n). In this paper we consider the intersection graphs associated with such random drawings. We prove that for any probability measures, the resulting random intersection graphs form a convergent graph sequence in the sense of graph limits. The edge density of the limiting graphon turns out to be independent of the two measures as long as they are antipodally symmetric. However, it is shown that the triangle densities behave differently. We examine a specific random model, blow-ups of antipodal drawings D of K_4,4, and show that the triangle density in the corresponding crossing graphon depends on the angles between the great circles containing the edges in D and can attain any value in the interval (83/12288, 128/12288).

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset