Vol. 12, No. 7, 2019

Download this article
Download this article For screen
For printing
Recent Issues

Volume 17
Issue 2, 183–362
Issue 1, 1–182

Volume 16, 5 issues

Volume 15, 5 issues

Volume 14, 5 issues

Volume 13, 5 issues

Volume 12, 8 issues

Volume 11, 5 issues

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
About the journal
Ethics and policies
Peer-review process
Submission guidelines
Submission form
Editorial board
Editors' interests
ISSN (electronic): 1944-4184
ISSN (print): 1944-4176
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

For n,k , let KG(n,k) be the usual Kneser graph (whose vertices are k-sets of {1,2,,n} with A B if and only if A B = ). The Hadwiger number of a graph G, denoted by h(G), is max{t : Kt 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.

Kneser graphs, Hadwiger number
Mathematical Subject Classification 2010
Primary: 05C83, 05C80, 05D40
Received: 31 October 2018
Revised: 19 February 2019
Accepted: 11 May 2019
Published: 12 October 2019

Communicated by Anant Godbole
Arran Hamm
Department of Mathematics
Winthrop University
Rock Hill, SC
United States
Kristen Melton
Department of Mathematics
Miami University
Oxford, OH
United States