Centre for Discrete and Applicable Mathematics |
|
CDAM Research Report, LSE-CDAM-2004-11June 2004 |
Noga Alon, Graham Brightwell, H.A. Kierstead, A.V. Kostochka, and Peter Winkler
Abstract
A k-majority tournament T on a finite vertex set V is
defined by a set of 2k-1 linear orderings of V, with u ---> v if and only if u lies above v in at least k of the
orders. Motivated in part by the phenomenon of ``non-transitive dice'', we
let F(k) be the maximum over all k-majority tournaments T
of the size of a minimum dominating set of T.
We show that F(k) exists for all k>0, that F(2)=3 and that
in general C1 k/log k < F(k) < C2 klog k for suitable positive constants C1 and C2.
A PDF file (220 kB) with the full contents of this report can be downloaded by clicking here.
Alternatively, if you would like to get a free hard copy of this report, please send the number of this report, LSE-CDAM-2004-11, together with your name and postal address to:
CDAM Research Reports Series Centre for Discrete and Applicable Mathematics London School of Economics Houghton Street London WC2A 2AE, U.K. |
||
Phone: +44(0)-20-7955 7732. Fax: +44(0)-20-7955 6877. Email: info@cdam.lse.ac.uk |
Introduction to the CDAM Research Report Series. | ||
CDAM Homepage. |
Last changed: Wed 9 Feb 2005
For comments go to:
http://www.maths.lse.ac.uk/webmaster.html