Infinite Counterexamples to Written on the Wall II Conjecture 194

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 connected graph satisfying alpha(G) <= 1 + l_avg(G) has a Hamiltonian path. We give a three-parameter family of counterexamples. A one-parameter subfamily satisfies the proposed inequality with equality: for every integer t >= 3 it has 2t^2 vertices, independence number t + 1, and l_avg(G) = t, but has t pendant vertices and hence no Hamiltonian path. The first member of this subfamily has 18 vertices; that concrete case has also been verified in Lean 4.

Authors

Publication Details

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

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

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 connected graph satisfying alpha(G) <= 1 + l_avg(G) has a Hamiltonian path. We give a three-parameter family of counterexamples. A one-parameter subfamily satisfies the proposed inequality with equality: for every integer t >= 3 it has 2t^2 vertices, independence number t + 1, and l_avg(G) = t, but has t pendant vertices and hence no Hamiltonian path. The first member of this subfamily has 18 vertices; that concrete case has also been verified in Lean 4.

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.