Written on the Wall II, Graph Conjecture 103
For every connected graph $G$, is $\alpha(G) \le \lfloor b(G) - \log(\operatorname{ecc}_{avg}(G)) \rfloor$, where $b(G)$ is the largest induced-bipartite-subgraph order? An $11$-vertex counterexample - a triangle with four leaves on each of two vertices - has $\alpha = 9$ against bound $8$.
Exact FrontierDelta
Scope and record
Occurred: Jul 22, 2026
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: lean-verified. Publication: announcement. AI contribution: ai-discovered. Imported under CC BY 4.0.
Canonical aliases: Written on the Wall II, Graph Conjecture 103 · WoW 103
Confidence: Not scored
Registry verification: lean verified · announcement · resolved
Attribution
VibeMathed
registry · event recorded by
ChatGPT + Codex
model · ai model contributor · OpenAI
Lineage and corrections
This event attributed to ChatGPT + Codex