Hadwiger meets Cayley
Combinatorics
2020-05-14 v1
Abstract
We show that every connected k-chromatic graph contains at least kk−2 spanning trees.
Keywords
Cite
@article{arxiv.2005.05989,
title = {Hadwiger meets Cayley},
author = {Jacob W. Cooper and Adam Kabela and Daniel Král' and Théo Pierron},
journal= {arXiv preprint arXiv:2005.05989},
year = {2020}
}
Related papers
View all related →
Combinatorics · Mathematics
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties
J. Bang-Jensen, F. Havet, M. Kriesell, A. Yeo
2020-08-13
Combinatorics · Mathematics
Bounds of a number of leaves of spanning trees
Anton Bankevich, Dmitri Karpov
2014-05-29
Combinatorics · Mathematics
Progress on sufficient conditions for a graph to have a spanning $k-$ended tree
Pham Hoang Ha
2020-02-24
Computational Geometry · Computer Science
Plane Spanning Trees in Edge-Colored Simple Drawings of $K_n$
Oswin Aichholzer, Michael Hoffmann, Johannes Obenaus, Rosna Paul +4
2020-08-21
Combinatorics · Mathematics
Linkages in Large Graphs of Bounded Tree-Width
Jan-Oliver Fröhlich, Ken-ichi Kawarabayashi, Theodor Müller, Julian Pott +1
2014-02-25
Combinatorics · Mathematics
Connectivity keeping stars or double-stars in 2-connected graphs
Yingzhi Tian, Jixiang Meng, Hong-Jian Lai, Liqiong Xu
2017-07-26
Combinatorics · Mathematics
Globally balancing spanning trees
Florian Hörsch
2022-08-09
Combinatorics · Mathematics
Spanning trees with at most 4 leaves in $K_{1,5}-$free graphs
Yuan Chen, Pham Hoang Ha, Dang Dinh Hanh
2018-10-22
Combinatorics · Mathematics
Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs
Qing Yang, Yingzhi Tian
2023-03-08
Combinatorics · Mathematics
Rainbow spanning trees in properly coloured complete graphs
József Balogh, Hong Liu, Richard Montgomery
2017-04-25
Probability · Mathematics
One-ended spanning trees in amenable unimodular graphs
Adam Timar
2020-05-11
Combinatorics · Mathematics
Sufficient conditions for $k$-factors and spanning trees of graphs
Guoyan Ao, Ruifang Liu, Jinjiang Yuan, C. T. Ng +1
2023-08-29
Combinatorics · Mathematics
More on foxes
Matthias Kriesell, Jens M. Schmidt
2016-10-31
Combinatorics · Mathematics
Hadwiger's conjecture for the complements of Kneser graphs
Guangjun Xu, Sanming Zhou
2015-12-01
Combinatorics · Mathematics
Maximum number of colourings. I. 4-chromatic graphs
Fiachra Knox, Bojan Mohar
2017-08-08
Combinatorics · Mathematics
Highly connected orientations from edge-disjoint rigid subgraphs
Dániel Garamvölgyi, Tibor Jordán, Csaba Király, Soma Villányi
2025-03-12
Combinatorics · Mathematics
Counting Spanning Trees of Threshold Graphs
Stephen R. Chestnut, Donniell E. Fishkind
2013-01-09
Combinatorics · Mathematics
Hadwiger's Conjecture for squares of 2-Trees
L. Sunil Chandran, Davis Issac, Sanming Zhou
2019-10-03
Combinatorics · Mathematics
Spectral conditions for spanning $k$-trees or $k$-ended-trees of $t$-connected graphs
Jifu Lin, Zenan Du, Xinghui Zhao, Lihua You
2025-06-10
Combinatorics · Mathematics
Multicolored Isomorphic Spanning Trees in Complete Graphs
Hung-Lin Fu, Yuan-Hsun Lo
2016-05-17
Discrete Mathematics · Computer Science
Trees and co-trees in planar 3-connected graphs An easier proof via Schnyder woods
Christian Ortlieb, Jens M. Schmidt
2024-06-05
Combinatorics · Mathematics
Trestles in the squares of graphs
Adam Kabela, Jakub Teska
2021-03-16
Combinatorics · Mathematics
A closure result on spanning $k$-trees of graphs with given minimum degree
Wenqian Zhang
2026-04-28
Combinatorics · Mathematics
Spectral radius and spanning trees of graphs
Guoyan Ao, Ruifang Liu, Jinjiang Yuan
2022-12-13
Combinatorics · Mathematics
Connectivity keeping paths for k-connected bipartite graphs
Meng Ji
2024-12-24