arXiv (All)
open access
Random independent sets and local sparsity
We analyze random constructions of independent sets in locally sparse graphs, specifically graphs with bounded maximum average degree in neighborhoods or with fractionally $r$-colorable neighborhoods. Specializing our methods to finding large independent sets and low-weight fractional colorings, we
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
- Size-Sensitive Padded Decompositions for Faster Deterministic Negative-Weight Shortest Paths#1084376
- Locally Sparsified, Globally Near-Optimal: Matching under Independent Vertex Arrivals#1063372
- Improved SDP Coloring of 3-Colorable Graphs from Recursive Gaussian Certificates#1118757
- Degree-Mass Message Passing for Betweenness Ranking in Directed and Undirected Networks#652197
- Degree-Mass Message Passing for Betweenness Ranking in Directed and Undirected Networks#650744
Record · ID 927922
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