The proof of a conjecture of Bouabdallah and Sotteau
β Scribed by Min Xu; Xinmin Hou; Jun-Ming Xu
- Publisher
- John Wiley and Sons
- Year
- 2004
- Tongue
- English
- Weight
- 87 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
π 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
Let P(G, \*) denote the chromatic polynomial of a graph G. It is proved in this paper that for every connected graph G of order n and real number \* n, (\*&2) n&1 P(G, \*)&\*(\*&1) n&2 P(G, \*&1) 0. By this result, the following conjecture proposed by Bartels and Welsh is proved: P(G, n)(P(G, n&1))
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