{"id":"https://openalex.org/W7208729761","doi":"https://doi.org/10.48550/arxiv.2609.02953","title":"Alon's Question on Connectivity Graph-Codes: $f(d)=2^d$ for Every $d\\geq 4$","display_name":"Alon's Question on Connectivity Graph-Codes: $f(d)=2^d$ for Every $d\\geq 4$","publication_year":2026,"publication_date":"2026-09-02","ids":{"openalex":"https://openalex.org/W7208729761","doi":"https://doi.org/10.48550/arxiv.2609.02953"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.02953","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.02953","pdf_url":"https://arxiv.org/pdf/2609.02953","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2609.02953","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000278541","display_name":"Chenxiao Tian","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Tian, Chenxiao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5000278541"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.42579999566078186,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.42579999566078186,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.2937000095844269,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.16130000352859497,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/d-regular-graphs","display_name":"d-regular graphs","score":0.6899999976158142},{"id":"https://openalex.org/keywords/bipartite-graphs","display_name":"bipartite graphs","score":0.9520000219345093},{"id":"https://openalex.org/keywords/linear-codes","display_name":"linear codes","score":0.6470000147819519},{"id":"https://openalex.org/keywords/finite-simple-graphs","display_name":"finite simple graphs","score":0.5019999742507935}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7936000227928162},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7175999879837036},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5458999872207642},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5440000295639038},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5195000171661377},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5065000057220459},{"id":"https://openalex.org/C87945829","wikidata":"https://www.wikidata.org/wiki/Q1353233","display_name":"Conjugacy class","level":2,"score":0.4749999940395355},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.44209998846054077},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3978999853134155},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3962000012397766},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.3808000087738037},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36559998989105225},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.3140999972820282},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.29809999465942383},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.29499998688697815},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.28360000252723694},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.28189998865127563},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.28040000796318054},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.2775000035762787},{"id":"https://openalex.org/C119322782","wikidata":"https://www.wikidata.org/wiki/Q2662236","display_name":"VC dimension","level":2,"score":0.2720000147819519},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.26910001039505005},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.25760000944137573}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.02953","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.02953","pdf_url":"https://arxiv.org/pdf/2609.02953","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2609.02953","doi":"https://doi.org/10.48550/arxiv.2609.02953","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.02953","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.02953","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.02953","pdf_url":"https://arxiv.org/pdf/2609.02953","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7208729761.pdf","grobid_xml":"https://content.openalex.org/works/W7208729761.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1597750481","https://openalex.org/W4395049485","https://openalex.org/W1991381366","https://openalex.org/W2985942741","https://openalex.org/W2939751289","https://openalex.org/W7117001518","https://openalex.org/W4399973719","https://openalex.org/W2162054809","https://openalex.org/W4403469660","https://openalex.org/W2053196533"],"abstract_inverted_index":{"For":[0,130],"a":[1,5,9,19,43,71,114,125,138,152],"finite":[2,108],"graph":[3],"$H$,":[4],"connectivity":[6,116],"graph-code":[7,117],"is":[8,18],"family":[10],"$\\mathcal":[11,33],"C\\subseteq":[12],"2^{E(H)}$":[13],"such":[14,42],"that":[15],"$A\\triangle":[16],"B$":[17],"connected":[20],"spanning":[21],"subgraph":[22],"of":[23,32,41,118,128],"$H$":[24],"whenever":[25],"$A$":[26],"and":[27,45,84],"$B$":[28],"are":[29],"distinct":[30],"members":[31],"C$.":[34],"Let":[35],"$m(H)$":[36],"denote":[37],"the":[38,49,67,133,164],"maximum":[39],"size":[40],"family,":[44],"let":[46],"$f(d)$":[47],"be":[48],"largest":[50],"integer":[51],"$q$":[52],"for":[53,56,79,89,100],"which":[54],"$m(H)=q$":[55],"infinitely":[57,106],"many":[58,107],"pairwise":[59],"nonisomorphic":[60],"$d$-regular":[61,110],"graphs":[62,112],"$H$.":[63],"Restricting":[64],"codewords":[65],"to":[66],"edges":[68],"incident":[69],"with":[70,124],"vertex":[72],"gives":[73],"$f(d)\\leq":[74],"2^d$.":[75],"Alon":[76],"proved":[77],"equality":[78],"all":[80],"sufficiently":[81],"large":[82],"$d$":[83],"asked":[85],"whether":[86],"it":[87],"holds":[88],"every":[90,101],"$d\\geq":[91,102,131],"4$.":[92],"We":[93],"answer":[94],"this":[95],"question":[96],"affirmatively.":[97],"More":[98],"precisely,":[99],"4$":[103],"we":[104],"construct":[105],"simple":[109],"bipartite":[111],"carrying":[113],"linear":[115],"dimension":[119],"$d$.":[120],"The":[121],"construction":[122],"begins":[123],"vector-labelled":[126],"copy":[127],"$K_{d,d}$.":[129],"7$,":[132],"required":[134,165],"labelling":[135],"follows":[136],"from":[137],"probabilistic":[139],"count":[140],"over":[141],"an":[142],"irreducible":[143],"conjugacy":[144],"class":[145],"in":[146],"$\\mathrm{GL}_d(2)$;":[147],"explicit":[148],"matrices,":[149],"verified":[150],"by":[151],"short":[153],"exact":[154],"exhaustive":[155],"program,":[156],"cover":[157],"$d=4,5,6$.":[158],"Cyclic":[159],"voltage":[160],"lifts":[161],"then":[162],"produce":[163],"infinite":[166],"families.":[167]},"counts_by_year":[],"updated_date":"2026-10-28T10:33:24.094632","created_date":"2026-09-05T00:00:00"}