✦ LIBER ✦

The Critical Point ofk-Clique Percolation in the Erdős–Rényi Graph

✍ Scribed by Gergely Palla; Imre Derényi; Tamás Vicsek

Book ID: 106431016
Publisher: Springer
Year: 2006
Tongue: English
Weight: 210 KB
Volume: 128
Category: Article
ISSN: 0022-4715
DOI: 10.1007/s10955-006-9184-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Explosive Percolation in Erdős-Rényi-Lik

Explosive Percolation in Erdős-Rényi-Like Random Graph Processes

✍ Konstantinos Panagiotou; Reto Spöhel; Angelika Steger; Henning Thomas 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 204 KB

The large deviation principle for the Er

The large deviation principle for the Erdős-Rényi random graph

✍ Sourav Chatterjee; S.R.S. Varadhan 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 296 KB

Spectral Statistics of Erdős-Rényi Graph

Spectral Statistics of Erdős-Rényi Graphs II: Eigenvalue Spacing and the Extreme Eigenvalues

✍ László Erdős, Antti Knowles, Horng-Tzer Yau, Jun Yin 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 601 KB

On the independence number of the Erdős-

On the independence number of the Erdős-Rényi and projective norm graphs and a related hypergraph

✍ Dhruv Mubayi; Jason Williford 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB

## Abstract The Erdős‐Rényi and Projective Norm graphs are algebraically defined graphs that have proved useful in supplying constructions in extremal graph theory and Ramsey theory. Their eigenvalues have been computed and this yields an upper bound on their independence number. Here we show that