✦ LIBER ✦

Small Subgraphs of k-Partite Random Graphs

✍ Scribed by MICHAL KAROŃSKI; ANDRZEJ RUCIŃSKI

Book ID: 119863016
Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 472 KB
Volume: 555
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1989.tb22457.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

K4-free subgraphs of random graphs revis

K4-free subgraphs of random graphs revisited

✍ S. Gerke; H. J. Prömel; T. Schickinger; A. Steger; A. Taraz 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 400 KB

The number of complete subgraphs of equi

The number of complete subgraphs of equi-partite graphs

✍ Guoping Jin 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 307 KB

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

Spanning subgraphs of random graphs

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