arXiv (All)
open access
Thinning and sprinkling: from robust sampling to almost Hamiltonicity
We develop the thinning--sprinkling technique, a general method for proving robustness of graph properties under random vertex sampling. Using it, we show that random induced subgraphs of tough graphs, high-degree connected vertex-transitive graphs, and nearly regular sublinear expanders retain stro
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
- First-Passage Percolation on Spread-out line graphs: Microscopic Regime#821967
- Soft modes in vector spin glass models on sparse random graphs#408695
- Analysis of Polynomial Threshold Functions on Random Regular Graphs: Computational Complexity of Detecting Noisy Random Lifts#972474
- Reconstructing the Geometry of Random Geometric Graphs#128275
- Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence#924468
Record · ID 1078236
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