𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast graphs for the random walker

✍ Scribed by Bálint Virág

Book ID
106138336
Publisher
Springer
Year
2002
Tongue
English
Weight
166 KB
Volume
124
Category
Article
ISSN
1432-2064

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New paths for random walkers
New paths for random walkers
✍ Shlesinger, Michael F. 📂 Article 📅 1992 🏛 Nature Publishing Group 🌐 English ⚖ 302 KB
Bandwidth theorem for random graphs
Bandwidth theorem for random graphs
✍ Hao Huang; Choongbum Lee; Benny Sudakov 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 381 KB
Random Ramsey graphs for the four-cycle
Random Ramsey graphs for the four-cycle
✍ Zoltán Füredi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 223 KB

It is shown that there is a graph 4 with n vertices and at least n ' "edges such that it contains neither Ws nor X2 3 , but every subgraph with 2n4'3(logn)Z edges contains a vd, (n>n,). Moreover, the chromatic number of Y is at least no.'.