𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new proof of a theorem of Graham and Pollak

✍ Scribed by G.W Peck

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
83 KB
Volume
49
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A new proof of menger's theorem
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 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

A new proof of the Freyd's theorem
A new proof of the Freyd's theorem
✍ JiΕ™i VinΓ‘rek πŸ“‚ Article πŸ“… 1976 πŸ› Elsevier Science 🌐 English βš– 303 KB
A new proof of the 6 color theorem
A new proof of the 6 color theorem
✍ Oleg V. Borodin πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 579 KB

## Abstract In 1965 Ringel raised a 6 color problem for graphs that can be stated in at least three different forms. In particular, is it possible to color the vertices and faces of every plane graph with 6 colors so that any two adjacent or incident elements are colored differently? This 6 color p