arXiv (OAI Expanded)
open access
Local Search for Almost-Spanning Square Grids in Erdős--Rényi Random Graphs
Finding large lattice subgraphs in sparse Erdős--Rényi random graphs is a classical problem at the interface of random graph theory and algorithms. General bounded-degree embedding and universality theorems give powerful results for broad graph families, but when specialized to square grids they ope
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
- Beyond Sparse Supervision: Diffusion-Guided Learning for Few-Shot Graph Fraud Detection#319677
- Asymptotic Bounds for Irredundant Covers of Square Grids by 2 x 2 Cards#1084406
- Extremal Spanning Trees of Random Marked Graphs with Independent Edge Weights#1062064
- Descriptive complexity results related to uniform distribution theory (Analytic Number Theory and Related Topics)#378247
- Descriptive complexity results related to uniform distribution theory (Analytic Number Theory and Related Topics)#378240
Record · ID 1070133
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