✦ LIBER ✦

Largest sparse subgraphs of random graphs

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

Book ID: 119236579
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 184 KB
Volume: 38
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2011.09.057

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Extremal subgraphs of random graphs

✍ László Babai; Miklós Simonovits; Joel Spencer 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 1015 KB

## Abstract We shall prove that if __L__ is a 3‐chromatic (so called “forbidden”) graph, and —__R__^__n__^ is a random graph on __n__ vertices, whose edges are chosen independently, with probability __p__, and —__B__^__n__^ is a bipartite subgraph of __R__^__n__^ of maximum size, —__F__^__n__^ is a