Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2512.12852 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917146598047744 |
|---|---|
| author | Lavee, Nir Linial, Nati |
| author_facet | Lavee, Nir Linial, Nati |
| contents | Consider the random process that starts with $n$ vertices and no edges, where the edges of $K_n$ are added one at a time in a uniformly chosen random order $e_1, e_2,\ldots, e_{\binom{n}{2}}$. Let $T$ be the earliest time at which $e_1$ belongs to a cycle in this evolving random graph. By solving the appropriate graph enumeration problem we show that $\mathbb{E}[T]=n$. This fact turns out to be an instance of a much more general phenomenon and we are able to extend this theorem to all graphs and even to every matroid. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_12852 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Time to Cycle Lavee, Nir Linial, Nati Combinatorics Consider the random process that starts with $n$ vertices and no edges, where the edges of $K_n$ are added one at a time in a uniformly chosen random order $e_1, e_2,\ldots, e_{\binom{n}{2}}$. Let $T$ be the earliest time at which $e_1$ belongs to a cycle in this evolving random graph. By solving the appropriate graph enumeration problem we show that $\mathbb{E}[T]=n$. This fact turns out to be an instance of a much more general phenomenon and we are able to extend this theorem to all graphs and even to every matroid. |
| title | Time to Cycle |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2512.12852 |