Title of article
Clique number and ball containment number of unit ball graphs
Author/Authors
S Ceroi، نويسنده , , Stephan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
4
From page
22
To page
25
Abstract
For each d ≥ 2, we give the construction of a sequence (νdn)n>o of sets of (d+l)n points of diameter 1 in d, such that a unit ball cannot contain more than 1(d + 1)∣νn∣ + 1 points. In the case d=2, this answers a conjecture of McDiarmid.
Keywords
Unit ball graphs , Borsukיs problem , ball containment number , clique number , proximity graphs
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2001
Journal title
Electronic Notes in Discrete Mathematics
Record number
1453163
Link To Document