Lean-Certified Infinite Counterexamples to Written on the Wall II Conjecture 194

{"For":[0],"a":[1,57,62,170],"finite":[2],"simple":[3,42],"graph":[4,44,175],"G,":[5],"let":[6,13],"alpha(G)":[7,51],"denote":[8],"its":[9,29,126,228],"independence":[10,26,95,129],"number":[11,27,96],"and":[12,85,103,138,230],"l_avg(G)":[14,55,100],"=":[15,101,157],"(1":[16],"/":[17],"|V(G)|)":[18],"sum_{v":[19],"in":[20,118],"V(G)}":[21],"alpha(G[N_G(v)])":[22],"be":[23],"the":[24,34,72,148,152,163,191,224,238,244,251,258,265,272],"average":[25,131],"of":[28,65,80,140,172],"open":[30],"neighbourhoods.":[31],"Written":[32,242],"on":[33,45,147,197,243],"Wall":[35,245],"II":[36,246],"Conjecture":[37,211,217,247,255],"194":[38,212,218,256],"asserts":[39],"that":[40,173,207],"every":[41,78],"connected":[43],"n":[46],">":[47,232],"1":[48,53,84],"vertices":[49],"satisfying":[50],"<=":[52],"+":[54,92,98],"has":[56,90,108,159],"Hamiltonian":[58,110],"path.":[59,111],"We":[60],"give":[61],"four-parameter":[63],"family":[64],"counterexamples.":[66],"Its":[67],"principal":[68],"two-parameter":[69],"subfamily":[70,115],"satisfies":[71],"proposed":[73],"inequality":[74,260],"with":[75,215,261],"equality:":[76],"for":[77,264],"pair":[79],"integers":[81],"s":[82],">=":[83,87],"t":[86,97],"3":[88],"it":[89],"(s":[91],"1)t^2":[93],"vertices,":[94,161],"1,":[99],"t,":[102],"minimum":[104,134,149],"degree":[105,150],"s,":[106],"but":[107,162],"no":[109,143],"This":[112],"entire":[113],"infinite":[114],"is":[116,166,219,250,257,282],"machine-checked":[117],"Lean":[119,280],"4:":[120],"one":[121,174],"universally":[122],"quantified":[123],"theorem":[124],"certifies":[125],"order,":[127],"connectivity,":[128],"number,":[130],"neighbourhood":[132],"independence,":[133],"degree,":[135],"conjecture":[136],"hypothesis,":[137],"failure":[139],"traceability.":[141],"Thus":[142],"fixed":[144],"lower":[145],"bound":[146],"repairs":[151],"conjecture.":[153],"The":[154,185,235,279],"case":[155],"(s,t)":[156],"(1,3)":[158],"18":[160],"formal":[164],"certificate":[165],"parametric":[167],"rather":[168],"than":[169],"verification":[171],"alone.":[176],"Version":[177],"1.2":[178],"changes,":[179],"mathematics":[180],"unchanged":[181],"from":[182,223,274],"version":[183],"1.1.":[184],"upstream":[186],"correction":[187],"was":[188],"merged":[189],"into":[190],"Google":[192],"DeepMind":[193],"Formal":[194],"Conjectures":[195],"repository":[196,208],"7":[198],"August":[199],"2026":[200],"as":[201,213],"pull":[202],"request":[203],"4542,":[204],"commit":[205],"5bc5de9901e7c6b1cb3529fecd88d43a6a66a37a;":[206],"now":[209,220,283],"records":[210],"solved":[214],"answer(False).":[216],"quoted":[221],"faithfully":[222],"source":[225],"collection,":[226],"including":[227],"\\"simple\\"":[229],"\\"n":[231],"1\\"":[233],"hypotheses.":[234],"introduction":[236],"states":[237],"exact":[239],"relationship":[240],"to":[241,277],"195,":[248],"which":[249],"Chvatal-Erdos":[252],"traceability":[253],"corollary:":[254],"same":[259],"l_avg":[262],"substituted":[263],"connectivity.":[266],"Six":[267],"references":[268],"were":[269],"added,":[270],"taking":[271],"bibliography":[273],"5":[275],"entries":[276],"11.":[278],"development":[281],"archived":[284],"at":[285],"doi:10.5281/zenodo.22779981.":[286]}

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-16
DOI
https://doi.org/10.5281/zenodo.21498167
Primary Topic
Limits and Structures in Graph Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
preprint

Lean-Certified Infinite Counterexamples to Written on the Wall II Conjecture 194

Cameron Beeley
Zenodo (CERN European Organization for Nuclear Research)
Limits and Structures in Graph Theory
preprint

Lean-Certified Infinite Counterexamples to Written on the Wall II Conjecture 194

Cameron Beeley
preprint en

Abstract

For a finite simple graph G, let alpha(G) denote its independence number and let l_avg(G) = (1 / |V(G)|) sum_{v in V(G)} alpha(G[N_G(v)]) be the average independence number of its open neighbourhoods. Written on the Wall II Conjecture 194 asserts that every simple connected graph on n > 1 vertices satisfying alpha(G) <= 1 + l_avg(G) has a Hamiltonian path. We give a four-parameter family of counterexamples. Its principal two-parameter subfamily satisfies the proposed inequality with equality: for every pair of integers s >= 1 and t >= 3 it has (s + 1)t^2 vertices, independence number t + 1, l_avg(G) = t, and minimum degree s, but has no Hamiltonian path. This entire infinite subfamily is machine-checked in Lean 4: one universally quantified theorem certifies its order, connectivity, independence number, average neighbourhood independence, minimum degree, conjecture hypothesis, and failure of traceability. Thus no fixed lower bound on the minimum degree repairs the conjecture. The case (s,t) = (1,3) has 18 vertices, but the formal certificate is parametric rather than a verification of that one graph alone. Version 1.2 changes, mathematics unchanged from version 1.1. The upstream correction was merged into the Google DeepMind Formal Conjectures repository on 7 August 2026 as pull request 4542, commit 5bc5de9901e7c6b1cb3529fecd88d43a6a66a37a; that repository now records Conjecture 194 as solved with answer(False). Conjecture 194 is now quoted faithfully from the source collection, including its "simple" and "n > 1" hypotheses. The introduction states the exact relationship to Written on the Wall II Conjecture 195, which is the Chvatal-Erdos traceability corollary: Conjecture 194 is the same inequality with l_avg substituted for the connectivity. Six references were added, taking the bibliography from 5 entries to 11. The Lean development is now archived at doi:10.5281/zenodo.22779981.

Zenodo (CERN European Organization for Nuclear Research)
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.