Proof of a Conjecture of De Caen and Van Dam
β Scribed by Gary L. Ebert; Sebastian Egner; Henk D.L. Hollmann; Qing Xiang
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 71 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
β¦ Synopsis
We present a proof for a conjecture of De Caen and Van Dam (2001, Europ. J. Combinatorics, 22, 297-301) concerning the existence of a four-class association scheme on the set of all unordered pairs of points of the projective line PG(1, q 2 ), where q = 2 m .
π SIMILAR VOLUMES
We give a simple linear algebraic proof of the following conjecture of Frankl and Fu redi [7,9,13]. (Frankl We generalise a method of Palisse and our proof-technique can be viewed as a variant of the technique used by Tverberg to prove a result of Graham and Pollak [10,11,14]. Our proof-technique
A tree T is said to be bad, if it is the vertex-disjoint union of two stars plus an edge joining the center of the first star to an end-vertex of the second star. A tree T is good, if it is not bad. In this article, we prove a conjecture of Alan Hartman that, for any spanning tree T of K 2m , where
Bateman and Erdo s found necessary and sufficient conditions on a set A for the kth differences of the partitions of n with parts in A, p (k) A (n), to eventually be positive; moreover, they showed that when these conditions occur p (k+1) A (n) tends to zero as n tends to infinity. Bateman and Erdo