arXiv (All)
open access
The Last Isolated Vertex in Random-Order Uncovering of Cycles and Their Powers: Exact Enumeration and Weibull Limits
Let the vertices of a graph be revealed one at a time in a uniformly random order, and let the last-isolation time be the last time at which the induced graph on the revealed vertices contains an isolated vertex. For the cycle C_n, write K_n for the number of vertices still unrevealed at this time.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Visibility Polynomial of Some Graph Classes#1012058
- Incompressibility and spectral gaps of random circuits#1051965
- Detection of first homology via random geometric graphs in the thermodynamic regime#821996
- Facilitated Exclusion Process in Higher Dimensions: Recurrent Structure and Transient Dynamics#1013042
- An Exposition of GPT Astra's Proof of Lower Bound on DP Continual Counting#1076185
Record · ID 1077417
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive