✦ LIBER ✦

Dirac's theorem for random graphs

✍ Scribed by Choongbum Lee; Benny Sudakov

Book ID: 112187398
Publisher: John Wiley and Sons
Year: 2012
Tongue: English
Weight: 151 KB
Volume: 41
Category: Article
ISSN: 1042-9832
DOI: 10.1002/rsa.20419

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Turán's theorem for pseudo-random graphs

✍ Yoshiharu Kohayakawa; Vojtěch Rödl; Mathias Schacht; Papa Sissokho; Jozef Skokan 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 286 KB

A generalization of Dirac’s theorem for

A generalization of Dirac’s theorem for K(1,3)-free graphs

✍ R. J. Faudree; R. J. Gould; M. S. Jacobson; L. M. Lesniak; T. E. Lindquester 📂 Article 📅 1992 🏛 Springer Netherlands 🌐 English ⚖ 824 KB

A dirac-type theorem for squares of grap

A dirac-type theorem for squares of graphs

✍ Tomasz Traczyk Jr. 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 221 KB

We prove that if G is a connected graph with p vertices and minimum degree greater than max( p/4 -1,3) then G2 is pancyclic. The result is best possible of its kind.

Levinson's theorem for graphs

✍ Childs, Andrew M.; Strouse, D J 📂 Article 📅 2011 🏛 American Institute of Physics 🌐 English ⚖ 365 KB

Dirac's map-color theorem for choosabili

Dirac's map-color theorem for choosability

✍ B�hme, T.; Mohar, B.; Stiebitz, M. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 290 KB

It is proved that the choice number of every graph G embedded on a surface of Euler genus ε ≥ 1 and ε = 3 is at most the Heawood number H(ε) = (7 + √ 24ε + 1)/2 and that the equality holds if and only if G contains the complete graph K H(ε) as a subgraph.

Separability generalizes Dirac's theorem

✍ Anne Berry; Jean-Paul Bordat 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 736 KB

In our study of the extremities of a graph, we define a moplex as a maximal clique module the neighborhood of which is a minimal separator of the graph. This notion enables us to strengthen Dirac's theorem : "Every non-clique triangulated graph has at least two non-adjacent simplicial vertices", res