Changes

Jump to: navigation, search

Goddyn's conjecture on thin spanning trees

166 bytes added, 10:01, 9 September 2015
The following related theorem follows from the work of Batson, Spielman and Srivastava <ref name="BaSpSr"/>
 
'''Theorem.''' Given an arbitrary graph <math>G=(V,E)</math>, there exists <math>F \subseteq E</math> of size <math>|V|</math> that is <math>4|V|/|E|</math>-thin.
 
==Related conjectures==
1,595
edits