Back to Problems

conjecture6

Specification

WOWII [Conjecture 6](http://cms.dt.uh.edu/faculty/delavinae/research/wowII/) For a connected graph `G` we have `Ls(G) ≥ 1 + n(G) - m(G) - a(G)` where `a(G)` is defined via independent sets.

Actions

Submit a Proof

Have a proof attempt? Submit it for zero-trust verification.

Submit Proof
Lean 4 Statement 
theorem conjecture6 (G : SimpleGraph α) [DecidableRel G.Adj] (h_conn : G.Connected) :
    1 + n G - m G - α(G) ≤ Ls G
ID: WrittenOnTheWallII__GraphConjecture6__conjecture6
Browse 300 unsolved math conjectures formalized in Lean 4
Browse

All Problems

Explore all 300 unsolved conjectures.

View problems →
ASI Prize documentation for formal verification pipeline
Docs

Verification Pipeline

How zero-trust verification works.

Read docs →
Evaluation Results

Recent Submissions

No submissions yet. Be the first to attempt this problem.