✦ LIBER ✦

Proof of a conjecture of Z. Kopal

✍ Scribed by Neal D. Newby Jr.

Publisher: Elsevier Science
Year: 1964
Tongue: English
Weight: 148 KB
Volume: 12
Category: Article
ISSN: 0032-0633
DOI: 10.1016/0032-0633(64)90215-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Proof of a conjecture of Alan Hartman

✍ Liu, Q. Z.; Yap, H. P. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 265 KB 👁 2 views

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

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

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

A combinatorial proof of Dyson's conject

A combinatorial proof of Dyson's conjecture

✍ Doron Zeilberger 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 541 KB

A short proof of Minc's conjecture

✍ A Schrijver 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 150 KB