combinatorics / Extremal graph theory
For a finite connected graph $G$, let $L_s(G)$ be the maximum number of leaves in a spanning tree and $\ell(G)$ the average local independence number. Must $L_s(G) \ge 2(\ell(G) - 1)$?
Temporal state
No reconciled state yet.
Append-only history
For a finite connected graph $G$, let $L_s(G)$ be the maximum number of leaves in a spanning tree and $\ell(G)$ the average local independence number. Must $L_s(G) \ge 2(\ell(G) - 1)$?
Research memory
For a finite connected graph $G$, let $L_s(G)$ be the maximum number of leaves in a spanning tree and $\ell(G)$ the average local independence number. Must $L_s(G) \ge 2(\ell(G) - 1)$?
Evidence graph
No public relationships recorded yet.