✦ 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
DOI: 10.4153/cjm-1973-077-1

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

Ramsey's theorem and self-complementary

Ramsey's theorem and self-complementary graphs

✍ V. Chvatal; P. Erdös; Z. Hedrlin 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 349 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

Graphs and Bergman′s GK Gap Theorem

✍ H.W. Ellingsen; D.R. Farkas 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 347 KB