Graph Theory and Combinatorics 1988 (eBook)

B. Bollobas (Herausgeber)

eBook Download: PDF

1989 | 1. Auflage
409 Seiten
Elsevier Science (Verlag)
978-0-08-086783-0 (ISBN)

Infos

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 has provided a huge stimulus for workers in the field. There is hardly any branch of combinatorics that has not been greatly enriched by his ideas.

This volume is dedicated to Paul Erd&odblac,s on the occasion of his seventy-fifth birthday.

---

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ős, whose penetrating insight and insatiable curiosity has provided a huge stimulus for workers in the field. There is hardly any branch of combinatorics that has not been greatly enriched by his ideas.This volume is dedicated to Paul Erdős on the occasion of his seventy-fifth birthday.

Inhalt

Front Cover 1
Graph Theory and Combinatorics 1988 4
Copyright Page 5
Contents 6
Preface 10
Chapter 1. Paul Erdös at Seventy-Five 12
Chapter 2. Packing smaller graphs into a graph 16
Chapter 3. The star arboricity of graphs 20
Chapter 4. Graphs with a small number of distinct induced subgraphs 32
Chapter 5. Extensions of networks with given diameter 40
Chapter 6. Confluence of some presentations associated with graphs 50
Chapter 7. Long cycles in graphs with no subgraphs of minimal degree 3 56
Chapter 8. First cycles in random directed graph processes 64
Chapter 9. Trigraphs 78
Chapter 10. On clustering problems with connected optima in Euclidean spaces 90
Chapter 11. Some sequences of integers 98
Chapter 12. 1-Factorizing regular graphs of high degree – An improved bound 112
Chapter 13. Graphs with small bandwidth and cutwidth 122
Chapter 14. Simplicial decompositions of graphs: A survey of applications 130
Chapter 15. On the number of distinct induced subgraphs of a graph 154
Chapter 16. On the number of partitions of n without a given subsum (I) 164
Chapter 17. The first cycles in an evolving graph 176
Chapter 18. Covering the complete graph by partitions 226
Chapter 19. A density version of the Hales–Jewett theorem for k = 3 236
Chapter 20. On the path-complete bipartite Ramsey number 252
Chapter 21. Towards a solution of the Dinitz problem? 256
Chapter 22. A note on Latin squares with restricted support 262
Chapter 23. Pseudo-random hypergraphs 264
Chapter 24. Bouquets of geometric lattices: Some algebraic and topological aspects 288
Chapter 25. A short proof of a theorem of Vámos on matroid representations 324
Chapter 26. An on-line graph coloring algorithm with sublinear performance ratio 328
Chapter 27. The partite construction and Ramsey set systems 336
Chapter 28. Scaffold permutations 344
Chapter 29. Bounds on the measurable chromatic number of Rn 352
Chapter 30. A simple linear expected time algorithm for finding a hamilton path 382
Chapter 31. Dense expanders and pseudo-random bipartite graphs 390
Chapter 32. Forbidden graphs for degree and neighbourhood conditions 396
List of Contributors 414
Author Index 418

Produkt-Details

• Erscheint lt. Verlag: 1.7.1989
• Sprache: englisch
• Themenwelt: Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
• Themenwelt: Mathematik / Informatik ► Mathematik ► Finanz- / Wirtschaftsmathematik
• Themenwelt: Technik
• ISBN-10: 0-08-086783-9 / 0080867839
• ISBN-13: 978-0-08-086783-0 / 9780080867830