Hadwiger meets Cayley

Published 12 May 2020 in math.CO | (2005.05989v1)

Abstract: We show that every connected $k$ -chromatic graph contains at least $k<sup>{k-2}$ spanning trees.

Authors (4)

No one has generated a summary of this paper yet.

No one has generated a video about this paper yet.

No one has generated a whiteboard explanation for this paper yet.

We haven't generated a list of open problems mentioned in this paper yet.

We haven't generated follow-up questions for this paper yet.