arXiv (All)
open access
Exact three-component covers in 2-coloured random bipartite graphs
We resolve the two-colour three-component conjecture of Fernández, Pavez-Signé and Stein for random bipartite graphs. More precisely, we prove that if $G\sim G(n,n,p)$ and $p\gg\sqrt{\log n/n}$, then with high probability every red--blue edge-colouring of $G$ admits a cover of its vertex set by at m
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
- Multiset Colorings of Random Graphs Across Density Regimes#1049104
- A universal dichotomy for concentration in randomly colored graphs#924557
- A universal dichotomy for concentration in randomly colored graphs#920325
- Counting almost independent sets in regular graphs#1076184
- The b-chromatic number of a graph#652634
Record · ID 1011301
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