Hamiltonicity of Step-graphon
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866918268067905536 |
|---|---|
| author | Chen, Xudong |
| author_facet | Chen, Xudong |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_02074 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Hamiltonicity of Step-graphon Chen, Xudong Probability Combinatorics 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. |
| title | Hamiltonicity of Step-graphon |
| topic | Probability Combinatorics |
| url | https://arxiv.org/abs/2510.02074 |