On the Hadwiger number of Kneser graphs and their random subgraphs

Hamm, Arran; Melton, Kristen

doi:10.2140/involve.2019.12.1153

Download this article
	For screen
	For printing

Recent Issues

The Journal

About the journal

Ethics and policies

Peer-review process

Submission guidelines

ISSN 1944-4184 (online)

ISSN 1944-4176 (print)

Author index

To appear

Other MSP journals

On the Hadwiger number of Kneser graphs and their random subgraphs

Arran Hamm and Kristen Melton

Vol. 12 (2019), No. 7, 1153–1161

DOI: 10.2140/involve.2019.12.1153

Abstract

For $n, k \in ℕ$ , let $KG (n, k)$ be the usual Kneser graph (whose vertices are $k$ -sets of ${1, 2, \dots, n}$ with $A \sim B$ if and only if $A \cap B = \emptyset$ ). The Hadwiger number of a graph $G$ , denoted by $h (G)$ , is $max {t : K_{t} ≼ G}$ , where $H ≼ G$ if $H$ is a minor of $G$ . 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 $h (KG (n, k))$ and $h (KG {(n, k)}_{p})$ , where $KG {(n, k)}_{p}$ is the binomial random subgraph of $KG (n, k)$ with edge probability $p$ . Each of these bounds is larger than previous bounds under certain conditions on $k$ and $p$ .

Keywords

Kneser graphs, Hadwiger number

Mathematical Subject Classification 2010

Primary: 05C83, 05C80, 05D40

Milestones

Received: 31 October 2018

Revised: 19 February 2019

Accepted: 11 May 2019

Published: 12 October 2019

Communicated by Anant Godbole

Authors

Arran Hamm
Department of Mathematics Winthrop University Rock Hill, SC United States

Kristen Melton
Department of Mathematics Miami University Oxford, OH United States

Vol. 12, No. 7, 2019