✦ LIBER ✦

Proof of a conjecture of W. Veys

✍ Scribed by A.J. de Jong; J.H.M. Steenbrink

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 372 KB
Volume: 6
Category: Article
ISSN: 0019-3577
DOI: 10.1016/0019-3577(95)98203-n

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a conjecture of W. Veys

✍ E. Artal Bartolo; I. Luengo; A. Melle-Hernández 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 41 KB

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 conjecture of Bernstein

✍ Marko Tadić 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 308 KB

Proof of the Macdonald conjecture

✍ W. H. Mills; David P. Robbins; Howard Rumsey 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 547 KB

Proof of a Chromatic Polynomial Conjectu

Proof of a Chromatic Polynomial Conjecture

✍ 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))