✦ LIBER ✦

Largest sparse subgraphs of random graphs

✍ Scribed by Fountoulakis, Nikolaos; Kang, Ross J.; McDiarmid, Colin

Book ID: 123238286
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 410 KB
Volume: 35
Category: Article
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2013.06.012

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Largest sparse subgraphs of random graph

Largest sparse subgraphs of random graphs

✍ Nikolaos Fountoulakis; Ross J. Kang; Colin McDiarmid 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 184 KB

Orders of Induced Subgraphs in Sparse Ra

Orders of Induced Subgraphs in Sparse Random Graphs

✍ ZBIGNIEW PALKA 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 418 KB

Induced subgraphs in sparse random graph

Induced subgraphs in sparse random graphs with given degree sequences

✍ Pu Gao; Yi Su; Nicholas Wormald 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 872 KB

The largest induced tree in a sparse ran

The largest induced tree in a sparse random graph

✍ W. Fernandez de la Vega 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB 👁 2 views

The author proved that, for c > 1, the random graph G(n, p ) on n vertices with edge probability p = c / n contains almost always an induced tree on at least q n ( 1 -o( 1)) vertices, where L Y ~ is the positive root of the equation CLY = log( 1 + c'a). It is shown here that if c is sufficiently lar

Extremal subgraphs of random graphs

✍ Graham Brightwell; Konstantinos Panagiotou; Angelika Steger 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 698 KB

Subgraphs of Random Match-Graphs

✍ Jerzy Jaworski; Zbigniew Palka 📂 Article 📅 2001 🏛 Springer Japan 🌐 English ⚖ 117 KB