𝔖 Bobbio Scriptorium
✦   LIBER   ✦

K4-free subgraphs of random graphs revisited

✍ Scribed by S. Gerke; H. J. Prömel; T. Schickinger; A. Steger; A. Taraz

Publisher
Springer-Verlag
Year
2007
Tongue
English
Weight
400 KB
Volume
27
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pancyclic subgraphs of random graphs
Pancyclic subgraphs of random graphs
✍ Choongbum Lee; Wojciech Samotij 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 249 KB

## Abstract An __n__‐vertex graph is called pancyclic if it contains a cycle of length __t__ for all 3≤__t__≤__n__. In this article, we study pancyclicity of random graphs in the context of resilience, and prove that if __p__>__n__^−1/2^, then the random graph __G__(__n, p__) a.a.s. satisfies the f

Extremal subgraphs of random graphs
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