Select an Action
Random graphs '83 : based on lectures presented at the 1st Poznań Seminar on Random Graphs, August 23-25, 1983
Title:
Random graphs '83 : based on lectures presented at the 1st Poznań Seminar on Random Graphs, August 23-25, 1983
Author:
Karoński, Michał.
ISBN:
9780444878212
9780080872292
9781281788399
9786611788391
Publication Information:
Amsterdam ; New York : North-Holland ; New York, N.Y., U.S.A. : Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., 1985.
Physical Description:
1 online resource (viii, 363 pages) : illustrations.
Series:
North-Holland mathematics studies ; 118
Annals of discrete mathematics ; 28
North-Holland mathematics studies ; 118.
Annals of discrete mathematics ; 28.
Contents:
Front Cover; Random Graphs '83; Copyright Page; CONTENTS; Preface; List of Participants; Chapter 1. Welcoming address; Chapter 2. Random graphs and positional games on the complete graph; Chapter 3. A note on random mappings: Convolutions and partitions; Chapter 4. On matchings and hamiltonian cycles in random graphs; Chapter 5. Random graphs of small order; Chapter 6. Vertex-degrees in strata of a random recursive tree; Chapter 7. Reliability-estimation in stochastic graphs with time-associatcd arc-set reliability performance processes; Chapter 8. Electrical networks with random resistances
Chapter 9. A random bipartite mappingChapter 10. Probabilistic inequalities from extremal graph results (A survey); Chapter 11. A new version of the solution of a problem of Erdos and Renyi on hamiltonian cycles in undirected graphs; Chapter 12. Locally dependent random graphs and their use in the study of epidemic models; Chapter 13. A random sampling procedure from a finite population and some applications; Chapter 14. Three remarks on dimensions of graphs; Chapter 15. Bipartite complete induced subgraphs of a random graph; Chapter 16. Subgraphs of random graphs: A general approach
Chapter 17. Matchmaking between two collectionsChapter 18. Four roads to the Ramsey function; Chapter 19. Random graph problems in polymer chemistry; Chapter 20. Flows through complete graphs; Chapter 21. On the number of trees having k edges in common with a caterpillar of moderate degrees; Chapter 22. Random graphs almost optimally colorable in polynomial time; Chapter 23. Subcube coverings of random graphs in the n-cube; Chapter 24. Random graphs and polymerisation processes; Chapter 25. Critical percolation probabilities
Abstract:
The range of random graph topics covered in this volume includes structure, colouring, algorithms, mappings, trees, network flows, and percolation. The papers also illustrate the application of probability methods to Ramsey's problems, the application of graph theory methods to probability, and relations between games on graphs and random graphs.
Added Corporate Author:
Added Conference Author:
Electronic Access:
ScienceDirect http://www.sciencedirect.com/science/book/9780444878212 ScienceDirect http://www.sciencedirect.com/science/publication?issn=03040208&volume=118Available:*
Shelf Number | Item Barcode | Shelf Location | Status |
|---|---|---|---|
| QA166.17 .R36 1985 EB | 1191660-1001 | Elsevier E-Book Collections | Searching... |
On Order
Select a list
Make this your default list.
The following items were successfully added.
There was an error while adding the following items. Please try again.
:
Select An Item
Data usage warning: You will receive one text message for each title you selected.
Standard text messaging rates apply.