1 paper · 1 filter
Wanting Gao, Hong Hu, Xudong Chen
A graphon is said to have the H-property if a random undirected graph Gn on n nodes sampled from it has a node-wise disjoint cycle cover almost surely as n→∞. It ha…