All open problems
Source labels openChecked July 26, 2026

Written on the Wall IICombinatorics

Written on the Wall II - Conjecture 2

Mathematical statement

WOWII Conjecture 2

For a simple connected graph G, Ls(G) ≥ 2 · (l(G) - 1) where l(G) is the average independence number of the neighbourhoods of the vertices of G.

Statement source: Written on the Wall II statement material

Statement terms: Source-specific

Source-specific terms. Therefore does not assert reuse rights beyond attributed display.

Statement artifacts, not proofs

These records expose exact Lean propositions and statement-only wrappers. Defining a proposition does not supply a proof of it. A placeholder-bearing target also contains no proof. Elaboration checks syntax and types; it does not certify that a formalization perfectly captures every nuance of the informal problem.

Pinned Lean formulation 1

conjecture2

Canonical source
Complete statement target, proof intentionally absentLean 4
theorem conjecture2 (G : SimpleGraph α) (h : G.Connected) :  2 * (averageIndepNeighbors G - 1)  Ls G := by sorry
Statement source
Formal Conjectures
Lean version
v4.27.0
Placeholder
Present; no proof artifact
Source evidence
Pinned source index
Fidelity review
Community formulation

References