Hamiltonicity of inhomogeneous random graphs
Abstract
We provide a complete characterization of those graphons W for which the inhomogeneous random graph G(n,W) is asymptotically almost surely Hamiltonian. The characterization involves three conditions. Two of them constitute the characterization of G(n,W) being a.a.s. connected, as was shown recently by Hladk\'y and Viswanathan. The third condition captures a geometric obstacle which prevents G(n,W) from having perfect fractional matchings.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.