✦ LIBER ✦

The cofinality of the saturated uncountable random graph

✍ Scribed by Steve Warner

Publisher: Springer
Year: 2004
Tongue: English
Weight: 214 KB
Volume: 43
Category: Article
ISSN: 0933-5846
DOI: 10.1007/s00153-004-0223-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Endomorphism Monoid of the Random Gr

The Endomorphism Monoid of the Random Graph has Uncountably Many Ideals

✍ Dejan Delic; Igor Dolinka 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 311 KB

Random generations of the countable rand

Random generations of the countable random graph

✍ Su Gao; Chuang Shao 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 202 KB

The Monoid of the Random Graph

✍ Anthony Bonato, Dejan Delic 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 625 KB

The intersection graph of random sets

✍ Hiroshi Maehara 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 369 KB

Maehara, H., The intersection graph of random sets, Discrete Mathematics 87 (1991) 97-104. Let X,, i=l,..., n, be n = n(N) independent random subsets of {1,2,. . , N}, each selected at random out of the 2N subsets. We present some asymptotic (N-tm) properties of {Xi}, e.g. if r~/2~'~--+ m then {Xi}

The energy of random graphs

✍ Wenxue Du; Xueliang Li; Yiyang Li 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 224 KB

On the average genus of the random graph

✍ Saul Stahl 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 640 KB

## Abstract We obtain an upper bound on the expected number of regions in the randomly chosen orientable embedding of a fixed graph. This bound is ised to show that the average genus of the random graph on __v__ vertices is close to its maximum genus. More specifically, it is proven that the differ