𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Proof of a Conjecture by Lewandowski and Thiemann

✍ Scribed by Christian Fleischhack


Publisher
Springer
Year
2004
Tongue
English
Weight
290 KB
Volume
249
Category
Article
ISSN
0010-3616

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A proof of Boesch's conjecture
✍ Guifang Wang πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 596 KB
Proof of a conjecture of nirenberg
✍ Robert Osserman πŸ“‚ Article πŸ“… 1959 πŸ› John Wiley and Sons 🌐 English βš– 209 KB πŸ‘ 1 views
Proof of a Chromatic Polynomial Conjectu
✍ F.M. Dong πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 138 KB

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 proof of the Mullineux conjecture
✍ Ben Ford; Alexander S. Kleshchev πŸ“‚ Article πŸ“… 1997 πŸ› Springer-Verlag 🌐 French βš– 418 KB
Proof of a Conjecture of Frankl and FΓΌre
✍ Gurumurthi V. Ramanan πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 375 KB

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