✦ LIBER ✦

Extremal subgraphs of random graphs

✍ Scribed by Graham Brightwell; Konstantinos Panagiotou; Angelika Steger

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

✍ 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

Extremal subgraphs for two graphs

✍ F.R.K Chung; P Erdös; J Spencer 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 564 KB

Excluding induced subgraphs II: extremal

Excluding induced subgraphs II: extremal graphs

✍ H.J. Prömel; A. Steger 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 751 KB

Extremal Graphs without Topological Comp

Extremal Graphs without Topological Complete Subgraphs

✍ Cera, M.; Diánez, A.; Márquez, A. 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 163 KB

Subgraphs of Random Match-Graphs

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

Spanning subgraphs of random graphs

✍ Noga Alon; Zoltán Füredi 📂 Article 📅 1992 🏛 Springer Japan 🌐 English ⚖ 183 KB