Hamiltonicity of Step-graphon
Abstract
A step-graphon has the strong (resp., weak) H-property if a directed, random graph sampled from it has a Hamilton cycle (resp., a node-wise disjoint cycle cover) asymptotically almost surely. The weak/strong H-property is essentially a zero-one property. We identify key objects associated with the step-graphon that matter for the zero-one law and provide a complete characterization.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.