Graph theory and combinatorics, 1988 proceedings of the Cambridge Combinatorial Conference in honour of Paul Erdős
Combinatorics has not been an established branch of mathematics for very long: the last quarter of a century has seen an explosive growth in the subject. This growth has been largely due to the doyen of combinatorialists, Paul Erd & odblac;s, whose penetrating insight and insatiable curiosity ha...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Other Authors: | |
| Format: | eBook |
| Language: | English |
| Published: |
Amsterdam
North-Holland
1989, 1989
|
| Series: | Annals of discrete mathematics
|
| Subjects: | |
| Online Access: | |
| Collection: | Elsevier eBook collection Mathematics - Collection details see MPG.ReNa |
Table of Contents:
- Includes bibliographical references and index
- Front Cover; Graph Theory and Combinatorics 1988; Copyright Page; Contents; Preface; Chapter 1. Paul Erdös at Seventy-Five; Chapter 2. Packing smaller graphs into a graph; Chapter 3. The star arboricity of graphs; Chapter 4. Graphs with a small number of distinct induced subgraphs; Chapter 5. Extensions of networks with given diameter; Chapter 6. Confluence of some presentations associated with graphs; Chapter 7. Long cycles in graphs with no subgraphs of minimal degree 3; Chapter 8. First cycles in random directed graph processes; Chapter 9. Trigraphs