arXiv (All)
open access
Embedding edge-colored graphs in expanders with roll-back
We introduce a method to embed edge-colored graphs into families of expander graphs, which generalizes a framework developed by Draganić, Krivelevich, and Nenadov (2022). As an application, we show that each family of sufficiently pseudo-random graphs on $n$ vertices contains every edge-colored subd
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ős-Pósa Property for Colorful Minors#971921
- Truly Work-efficient Parallel Deterministic $(Δ+1)$-coloring and Maximal Independent Set#1459225
- Rapid Mixing for Sampling Colorings of Random Graphs up to Tree Uniqueness Threshold#1400220
- A finite-graph conjecture related to $θ(p_c)=0$ for Bernoulli bond percolation on $\mathbb Z^d$#971895
- Approximating Random Walks in $\widetilde{O}(\log n + \log^2 κ)$ Space for $κ$-Conditioned Graphs#1215882
Record · ID 1457111
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