|
This article is available for purchase or by subscription. See below.
Abstract
|
|
Let
be integers. Define a bipartite graph between all
-element and all
-element subsets
of an
-element
set by drawing an edge if and only if the first one contains the second.
The domination number of this graph is determined up to a factor of
. The
short proof relies on some extremal results concerning hypergraphs.
|
PDF Access Denied
We have not been able to recognize your IP address
3.236.207.90
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.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for
USD 40.00:
Keywords
finite sets, graphs, hypergraphs, Turán's theorem
|
Milestones
Received: 29 April 2019
Revised: 1 August 2019
Accepted: 15 August 2019
Published: 11 October 2019
|
|
