Random Graphs '85

Random Graphs '85

by M. Karonski, Z. Palka

353 pages· 2011· ISBN 9780080872551
About
Covering a wide range of Random Graphs subjects, this volume examines series-parallel networks, properties of random subgraphs of the n-cube, random binary and recursive trees, random digraphs, induced subgraphs and spanning trees in random graphs as well as matchings, hamiltonian cycles and closure in such structures. Papers in this collection also illustrate various aspects of percolation theory and its applications, properties of random lattices and random walks on such graphs, random allocation schemes, pseudo-random graphs and reliability of planar networks. Several open problems that were presented during a special session at the Seminar are also included at the end of the volume.

Discuss Random Graphs '85 with other readers

Join or start a book club for Random Graphs '85 on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Frequently asked questions

How do I join a book club for Random Graphs '85?

Sign up free on Readfeed, then browse public clubs or start your own club with Random Graphs '85 as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Random Graphs '85 with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Random Graphs '85 with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.