conjecture3

WOWII [Conjecture 3](http://cms.dt.uh.edu/faculty/delavinae/research/wowII/) For a connected simple graph `G`, the number of leaves in a maximum spanning tree satisfies `Ls(G) ≥ gi(G) * MaxTemp(G)`, where `gi(G)` is the independent domination number and `MaxTemp(G)` is `max_v deg(v)/(n(G) - deg(v))`.

theorem conjecture3 {G : SimpleGraph α} [DecidableEq α] [DecidableRel G.Adj] [Nontrivial α]
    (h_conn : G.Connected) :
    gi G * MaxTemp G ≤ Ls G

Recent Submissions

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