A pair of mathematicians solved a legendary question about the proportion of vertices in a graph with an odd number of connections.

Geometric intersection graphs form an intriguing class of structures in which vertices represent geometric objects – such as line segments, discs, or curves – and an edge is established ...

Abstract.For two vertices 𝑢 and 𝑣 of a graph 𝐺, the set 𝐼[𝑢, 𝑣] consists of all vertices lying on some 𝑢 - 𝑣 geodesic in 𝐺. If 𝑆 is a set of vertices of 𝐺, then 𝐼[𝑆] is the union of all ...

Journal of Applied Probability, Vol. 47, No. 3 (SEPTEMBER 2010), pp. 826-840 (15 pages) A random intersection graph G(n, m, p) is defined on a set 𝓥 of n vertices. There is an auxiliary set 𝓦 ...