For step-graphons the probability of a node-disjoint cycle cover in the sampled graph converges to 0 or 1 at either an exponential rate or a root-n rate.
Hamiltonicity of Step-graphons
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
An efficient O(|V(S)|^3) algorithm computes the largest 2-regular subgraph in complete S-partite graphs via integer linear programming.
citing papers explorer
-
Convergence rate of $H$-property for step-graphons
For step-graphons the probability of a node-disjoint cycle cover in the sampled graph converges to 0 or 1 at either an exponential rate or a root-n rate.
-
Largest $2$-regular Subgraphs in complete $S$-partite Graphs
An efficient O(|V(S)|^3) algorithm computes the largest 2-regular subgraph in complete S-partite graphs via integer linear programming.