Abstract
For , let be the usual Kneser graph (whose vertices are -sets of with if and only if ). The Hadwiger number of a graph , denoted by , is , where if is a minor of . Previously, lower bounds have been given on the Hadwiger number of a graph in terms of its average degree. In this paper we give lower bounds on and , where is the binomial random subgraph of with edge probability . Each of these bounds is larger than previous bounds under certain conditions on and .
Citation
Arran Hamm. Kristen Melton. "On the Hadwiger number of Kneser graphs and their random subgraphs." Involve 12 (7) 1153 - 1161, 2019. https://doi.org/10.2140/involve.2019.12.1153
Information