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

Kasteleyn's theorem and arbitrary graphs

โœ Scribed by Little, Charles H. C.


Book ID
111945116
Publisher
Canadian Mathematical Society
Year
1973
Tongue
French
Weight
622 KB
Volume
25
Category
Article
ISSN
0008-414X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Fatou's Theorem and minimal graphs
โœ Josรฉ M. Espinar; Harold Rosenberg ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 294 KB
Levinson's theorem for graphs
โœ Childs, Andrew M.; Strouse, D J ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› American Institute of Physics ๐ŸŒ English โš– 365 KB
MacLane's theorem for arbitrary surfaces
โœ Henning Bruhn; Reinhard Diestel ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 214 KB
Turรกn's theorem and k-connected graphs
โœ Nicolas Bougard; Gwenaรซl Joret ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 167 KB

## Abstract The minimum size of a __k__โ€connected graph with given order and stability number is investigated. If no connectivity is required, the answer is given by Turรกn's Theorem. For connected graphs, the problem has been solved recently independently by Christophe et al., and by Gitler and Val