arXiv (All)
open access
Graph Decompositions at the Expectation Threshold
For \(n\ge3\) and a graph \(H\) on at most \(n\) vertices, let \(q(H)\) be the expectation threshold for its containment in \(G(n,p)\). We prove that there are absolute constants \(a,L>0\) such that, for every \(C>0\), every graph of degeneracy at most \(C\log n/\log\log n\) has a deterministic edge
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
- The Erd\H os-Sós conjecture in dense graphs#985287
- The tree packing conjecture for trees of almost linear maximum degree#986755
- Faster Minimum k-Cut II: Near-Optimal and Deterministic for Weighted Graphs#1064341
- Locating-dominating partitions for some classes of graphs#147107
- Fundamentals of domination in graphs#1179875
Record · ID 1049974
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