arXiv (All)open access
Alon's Question on Connectivity Graph-Codes: $f(d)=2^d$ for Every $d\geq 4$
combinatorics, 05d05 (primary), 05c40, 05d40, 94b25 (secondary)
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 925335
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.