✦ LIBER ✦

A simple proof of a formula of Dershowitz and Zaks

✍ Scribed by Frank Ruskey

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 174 KB
Volume: 43
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(83)90028-6

No coin nor oath required. For personal study only.

✦ Synopsis

Let J&(1, d) be the number of nodes in the set of all ordered trees with n edges that are at level I and have degree d. Dershowitz and Zaks [l] prove that We reprove this result

📜 SIMILAR VOLUMES

A simple proof of the kinematic formula

✍ P. Mani-Levitska 📂 Article 📅 1988 🏛 Springer Vienna 🌐 English ⚖ 307 KB

A very simple proof of the eta transform

A very simple proof of the eta transformation formula

✍ Jürgen Elstrodt 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 81 KB

A new proof of Suzuki's formula

✍ R V Gurjar 📂 Article 📅 1997 🏛 Indian Academy of Sciences 🌐 English ⚖ 329 KB

A simple proof of a simple consensus alg

A simple proof of a simple consensus algorithm

✍ Jayadev Misra 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 641 KB

A combinatorial proof of the Mehler form

A combinatorial proof of the Mehler formula

✍ Dominique Foata 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 467 KB

A simple proof of Moser's theorem

✍ Zhu, Xuding 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB 👁 2 views

This article gives a simple proof of a result of Moser, which says that, for any rational number r between 2 and 3, there exists a planar graph G whose circular chromatic number is equal to r.