skip to content
Random graphs Preview this item
ClosePreview this item
Checking...

Random graphs

Author: Béla Bollobás
Publisher: London ; Orlando : Academic Press, 1985.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Additional Physical Format: Online version:
Bollobás, Béla.
Random graphs.
London ; Orlando : Academic Press, 1985
(OCoLC)622048491
Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: Béla Bollobás
ISBN: 0121117553 9780121117559 0121117561 9780121117566
OCLC Number: 12162651
Description: xvi, 447 pages : illustrations ; 24 cm
Contents: Probability Theoretic Preliminaries --
Notation and Basic Facts --
Some Basic Distributions --
Normal Approximation --
Inequalities --
Convergence in Distribution --
Models of Random Graphs --
The Basic Models --
Properties of Almost All Graphs --
Large Subsets of Vertices --
Random Regular Graphs --
The Degree Sequence --
The Distribution of an Element of the Degree Sequence --
Almost Determined Degrees --
The Shape of the Degree Sequence --
Jumps and Repeated Values --
Fast Algorithms for the Graph Isomorphism Problem --
Small Subgraphs --
Strictly Balanced Graphs --
Arbitrary Subgraphs --
Poisson Approximation --
The Evolution of Random Graphs--Sparse Components --
Trees of Given Sizes As Components --
The Number of Vertices on Tree Components --
The Largest Tree Components --
Components Containing Cycles --
The Evolution of Random Graphs--the Giant Component --
A Gap in the Sequence of Components --
The Emergence of the Giant Component --
Small Components after Time n/2 --
Further Results --
Two Applications --
Connectivity and Matchings --
The Connectedness of Random Graphs --
The k-Connectedness of Random Graphs --
Matchings in Bipartite Graphs --
Matchings in Random Graphs --
Reliable Networks --
Random Regular Graphs --
Long Paths and Cycles --
Long Paths in G[subscript c/n]--First Approach --
Hamilton Cycles--First Approach --
Hamilton Cycles--Second Approach --
Long Paths in G[subscript c/n]--Second Approach --
Hamilton Cycles in Regular Graphs--First Approach --
Hamilton Cycles in Regular Graphs--Second Approach.
Responsibility: Béla Bollobás.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/12162651>
library:oclcnum"12162651"
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/12162651>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:creator
schema:datePublished"1985"
schema:exampleOfWork<http://worldcat.org/entity/work/id/4910564>
schema:inLanguage"en"
schema:name"Random graphs"@en
schema:publisher
schema:url
schema:workExample
schema:workExample

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.