2 papers
math.CO2025
Random minimum spanning tree and dense graph limits
Jan Hladký, Gopal Viswanathan
A theorem of Frieze from 1985 asserts that the total weight of the minimum spanning tree of the complete graph whose edges get independent weights from the distribution $UNIF…
math.CO2024
Connectivity of inhomogeneous random graphs II
Jan Hladký, Gopal Viswanathan
Each graphon yields an inhomogeneous random graph model . We show that is asymptotically almost surely connected if and only if (i) is…