✦ LIBER ✦

A new proof of two theorems about rational transductions

✍ Scribed by André Arnold; Michel Latteux

Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 303 KB
Volume: 8
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(79)90049-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A short proof of a theorem about the cir

A short proof of a theorem about the circumference of a graph

✍ Tian Feng 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 125 KB

A new proof of menger's theorem

✍ Peter V. O'Neil 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB 👁 1 views

## Abstract A new proof of Menger's theorem is presented.

A new proof of Teljakowskii's theorem

✍ Heinz-Gerd Lehnhoff 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 151 KB

A short proof of the two-commodity flow

A short proof of the two-commodity flow theorem

✍ P.D Seymour 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 80 KB

A short proof of a theorem of dirac's ab

A short proof of a theorem of dirac's about hadwiger's conjecture

✍ D. R. Woodall 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB 👁 1 views

## Abstract A Short proof is given of the theorem that every grph that does not have __K__~4~ as a subcontraction is properly vertex 3‐colorable.

A New Proof of Monjardet's Median Theore

A New Proof of Monjardet's Median Theorem

✍ D.E. Loeb 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 354 KB

New proofs are given for Monjardet's theorem that all strong simple games (i.e., ipsodual elements of the free distributive lattice) can be generated by the median operation. Tighter limits are placed on the number of iterations necessary. Comparison is drawn with the / function which also generates