Random graphs par janson svante (22 résultats)

Hardcover. Etat : Fair. 1. The item might be beaten up but readable. May contain markings or highlighting, as well as stains, bent corners, or any other major defect, but the text is not obscured in any way.

Etat : Very Good. Very Good+; Hardcover; Covers are still glossy; Unblemished textblock edges; The endpapers and all text pages are clean and unmarked; The binding is excellent with a straight spine; This book will be shipped in a sturdy cardboard box with foam padding; Medium Format (8.5" - 9.75" tall); 1.4 lbs; Purple and gray covers with title in gray lettering; 2000, Wiley-Interscience Publishing; 348 pages; "Random Graphs," by Svante Janson, et al. …

HRD. Etat : New. New Book. Shipped from UK. Established seller since 2000.

Etat : new.

Etat : New.

Etat : As New. Unread book in perfect condition.

Etat : New.

Etat : As New. Unread book in perfect condition.

hardcover. Etat : New. In shrink wrap. Looks like an interesting title.

Etat : New.

Etat : New. In English.

Hardback. Etat : New. A unified, modern treatment of the theory of random graphs-including recent results and techniques Since its inception in the 1960s, the theory of random graphs has evolved into a dynamic branch of discrete mathematics. Yet despite the lively activity and important applications, the last comprehensive volume on the subject is Bollobas's well-known 1985 book. Poised to stimulate research for years to come, this new work covers developments of the last decade, providing a much-needed, modern overview of this fast-growing area of combinatorics. Written by three highly respected members of the discrete mathematics community, the book incorporates many disparate results from across the literature, including results obtained by the authors and some completely new results. Current tools and techniques are also thoroughly emphasized. Clear, easily accessible presentations make Random Graphs an ideal introduction for newcomers to the field and an excellent reference for scientists interested in discrete mathematics and theoretical computer science. Special features include: * A focus on the fundamental theory as well as basic models of random graphs * A detailed description of the phase transition phenomenon * Easy-to-apply exponential inequalities for large deviation bounds * An extensive study of the problem of containing small subgraphs * Results by Bollobas and others on the chromatic number of random graphs * The result by Robinson and Wormald on the existence of Hamilton cycles in random regular graphs * A gentle introduction to the zero-one laws * Ample exercises, figures, and bibliographic references.…

Etat : New. pp. xi + 333 Illus.

Etat : New. Since its inception in the 1960s, the theory of random graphs has evolved into a dynamic branch of discrete mathematics. Yet despite the lively activity and important applications, the last comprehensive volume on the subject is Bollobas's well-known 1985 book. Series: Wiley Series in Discrete Mathematics and Optimization. Num Pages: 348 pages, references, indexes. BIC Classification: PBV. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 241 x 164 x 25. Weight in Grams: 656. . 2000. 1st Edition. Hardcover. . . . .…

Etat : New. pp. xi + 333.

Etat : gut. 2000. Random Graphs (Wiley Series in Discrete Mathematics and Optimization) In englischer Sprache. pages.

Hardcover. Etat : Brand New. 333 pages. 9.25x6.25x0.75 inches. In Stock.

Etat : New. Since its inception in the 1960s, the theory of random graphs has evolved into a dynamic branch of discrete mathematics. Yet despite the lively activity and important applications, the last comprehensive volume on the subject is Bollobas's well-known 1985 book. Series: Wiley Series in Discrete Mathematics and Optimization. Num Pages: 348 pages, references, indexes. BIC Classification: PBV. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 241 x 164 x 25. Weight in Grams: 656. . 2000. 1st Edition. Hardcover. . . . . Books ship from the US and Ireland.…

Hardback. Etat : New. A unified, modern treatment of the theory of random graphs-including recent results and techniques Since its inception in the 1960s, the theory of random graphs has evolved into a dynamic branch of discrete mathematics. Yet despite the lively activity and important applications, the last comprehensive volume on the subject is Bollobas's well-known 1985 book. Poised to stimulate research for years to come, this new work covers developments of the last decade, providing a much-needed, modern overview of this fast-growing area of combinatorics. Written by three highly respected members of the discrete mathematics community, the book incorporates many disparate results from across the literature, including results obtained by the authors and some completely new results. Current tools and techniques are also thoroughly emphasized. Clear, easily accessible presentations make Random Graphs an ideal introduction for newcomers to the field and an excellent reference for scientists interested in discrete mathematics and theoretical computer science. Special features include: * A focus on the fundamental theory as well as basic models of random graphs * A detailed description of the phase transition phenomenon * Easy-to-apply exponential inequalities for large deviation bounds * An extensive study of the problem of containing small subgraphs * Results by Bollobas and others on the chromatic number of random graphs * The result by Robinson and Wormald on the existence of Hamilton cycles in random regular graphs * A gentle introduction to the zero-one laws * Ample exercises, figures, and bibliographic references.…

Hardcover. Etat : new. Hardcover. A unified, modern treatment of the theory of random graphs-including recent results and techniques Since its inception in the 1960s, the theory of random graphs has evolved into a dynamic branch of discrete mathematics. Yet despite the lively activity and important applications, the last comprehensive volume on the subject is Bollobas's well-known 1985 book. Poised to stimulate research for years to come, this new work covers developments of the last decade, providing a much-needed, modern overview of this fast-growing area of combinatorics. Written by three highly respected members of the discrete mathematics community, the book incorporates many disparate results from across the literature, including results obtained by the authors and some completely new results. Current tools and techniques are also thoroughly emphasized. Clear, easily accessible presentations make Random Graphs an ideal introduction for newcomers to the field and an excellent reference for scientists interested in discrete mathematics and theoretical computer science. Special features include: * A focus on the fundamental theory as well as basic models of random graphs * A detailed description of the phase transition phenomenon * Easy-to-apply exponential inequalities for large deviation bounds * An extensive study of the problem of containing small subgraphs * Results by Bollobas and others on the chromatic number of random graphs * The result by Robinson and Wormald on the existence of Hamilton cycles in random regular graphs * A gentle introduction to the zero-one laws * Ample exercises, figures, and bibliographic references Since its inception in the 1960s, the theory of random graphs has evolved into a dynamic branch of discrete mathematics. Yet despite the lively activity and important applications, the last comprehensive volume on the subject is Bollobas's well-known 1985 book. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…

Hardcover. Etat : Brand New. 333 pages. 9.25x6.25x0.75 inches. In Stock. This item is printed on demand.

Etat : New. PRINT ON DEMAND pp. xi + 333.