๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Proof of Petersen's Theorem

โœ Scribed by H. R. Brahana


Book ID
123919824
Publisher
John Hopkins University Press
Year
1917
Tongue
English
Weight
386 KB
Volume
19
Category
Article
ISSN
0003-486X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A generalization of Petersen's theorem
โœ Michel X. Goemans ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 338 KB

Goemans, M.X., A generalization of Petersen's theorem, Discrete Mathematics 115 (1993) 277-282. Petersen's theorem asserts that any cubic graph with at most 2 cut edges has a perfect matching. We generalize this classical result by showing that any cubic graph G = (V, E) with at most 1 cut edge has

On Petersen's graph theorem
โœ Nathan Linial ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 399 KB

In thiq paper we prove the following: let G be a graph with k edges, wihich js (k -l)-edgeconnectd, and with all valences 3k k. Let 1 c r~ k be an integer, then (3 -tins a spanning subgraph H, so that all valences in H are ar, with no more than r~/r:] edges. The proof is based on a useful extension

A proof of Thom's theorem
โœ A. L. Liulevicius ๐Ÿ“‚ Article ๐Ÿ“… 1962 ๐Ÿ› European Mathematical Society ๐ŸŒ English โš– 409 KB
A proof of Serre's theorem
โœ N.L. Biggs ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 253 KB
A proof of Beboutov's theorem
โœ Shizuo Kakutani ๐Ÿ“‚ Article ๐Ÿ“… 1968 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 340 KB
A proof of Fuglede's Theorem
โœ Joseph B Deeds ๐Ÿ“‚ Article ๐Ÿ“… 1969 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 64 KB