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
.
PDF Access Denied
We have not been able to recognize your IP address
13.59.130.130
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.