combinatorics / Graph theory (induced trees / graph invariants)

WOWII Conjecture 72: Two induced trees pin down tree(G G )

The evenly-divided reading of WOWII Conjecture 72 holds: ⌈(A+L)/3⌉≤t, \lceil(A + L)/3\rceil \le t, where t= t = tree(G G ) (order of a largest induced tree), A= A = average eccentricity and L= L = maximum neighbourhood independence number. A stronger reading that divides only L L by three is false. The argument rests on two elementary observations (a diametral path is chordless and therefore induces a tree on D+1 D+1 vertices; a maximum independent set in a neighbourhood induces a star on L+1 L+1 vertices). The original conjecture’s precise wording is not yet pinned in a public formal repository, so statement fidelity remains to be audited.

5Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

combinatoricsJul 23, 2026Significance 5/100Registry: site confirmed

WOWII Conjecture 72: Two induced trees pin down tree(G G )

Prior state unknown→proved

The evenly-divided reading of WOWII Conjecture 72 holds: ⌈(A+L)/3⌉≤t, \lceil(A + L)/3\rceil \le t, where t= t = tree(G G ) (order of a largest induced tree), A= A = average eccentricity and L= L = maximum neighbourhood independence number. A stronger reading that divides only L L by three is false. The argument rests on two elementary observations (a diametral path is chordless and therefore induces a tre…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

The evenly-divided reading of WOWII Conjecture 72 holds: ⌈(A+L)/3⌉≤t, \lceil(A + L)/3\rceil \le t, where t= t = tree(G G ) (order of a largest induced tree), A= A = average eccentricity and L= L = maximum neighbourhood independence number. A stronger reading that divides only L L by three is false. The argument rests on two elementary observations (a diametral path is chordless and therefore induces a tree on D+1 D+1 vertices; a maximum independent set in a neighbourhood induces a star on L+1 L+1 vertices). The original conjecture’s precise wording is not yet pinned in a public formal repository, so statement fidelity remains to be audited.

The evenly-divided reading of WOWII Conjecture 72 holds: ⌈(A+L)/3⌉≤t, \lceil(A + L)/3\rceil \le t, where t= t = tree(G G ) (order of a largest induced tree), A= A = average eccentricity and L= L = maximum neighbourhood independence number. A stronger reading that divides only L L by three is false. The argument rests on two elementary observations (a diametral path is chordless and therefore induces a tree on D+1 D+1 vertices; a maximum independent set in a neighbourhood induces a star on L+1 L+1 vertices). The original conjecture’s precise wording is not yet pinned in a public formal repository, so statement fidelity remains to be audited.

Recorded attempts

Evidence graph

Connected research record