 Random Graphs: Volume 2
ISBN: 978-0-471-57292-3
Hardcover
304 pages
April 1992
US $375.00
 Add to Cart
This price is valid for United States. Change location to view local pricing and availability. This is a Print-on-Demand title. It will be printed specifically to fill your order. Please allow an additional 1-2 days delivery time for paperbacks, and 3-5 days for hardcovers. The book is not returnable.
|
Partial table of contents:
Probability Distributions Related to the Local Structure of a Random Mapping (S. Berg & J. Jaworski).
Maximum Cuts and Quasirandom Graphs (F. Chung & R. Graham).
Inequalities for Random Walks on Trees (L. Devroye & A. Sbihi).
Spanning Trees in Random Graphs (P. Dolan).
Subgraphs of Large Minimal Degree (P. Erdos, et al.).
On Small Subgraphs of Random Graphs (A. Frieze).
When Is a Graphical Sequence Stable?
(M. Jerrum, et al.).
On the Stack Ramification of Binary Trees (R. Kemp).
The Number of Permutations with Cycle Lengths from a Fixed Set (V. Kolchin).
Sparse Random Graphs with a Given Degree Sequence (T. Luczak).
Proving Normality in Combinatorics (A. Rucinski).
Remarks on the Stochastic Traveling Salesman (E. Shamir).
Probability Distributions Related to the Local Structure of a Random Mapping (S. Berg & J. Jaworski).
Maximum Cuts and Quasirandom Graphs (F. Chung & R. Graham).
Inequalities for Random Walks on Trees (L. Devroye & A. Sbihi).
Spanning Trees in Random Graphs (P. Dolan).
Subgraphs of Large Minimal Degree (P. Erdos, et al.).
On Small Subgraphs of Random Graphs (A. Frieze).
When Is a Graphical Sequence Stable?
(M. Jerrum, et al.).
On the Stack Ramification of Binary Trees (R. Kemp).
The Number of Permutations with Cycle Lengths from a Fixed Set (V. Kolchin).
Sparse Random Graphs with a Given Degree Sequence (T. Luczak).
Proving Normality in Combinatorics (A. Rucinski).
Remarks on the Stochastic Traveling Salesman (E. Shamir).
