UID:
almahu_9947367843302882
Format:
1 online resource (419 p.)
ISBN:
1-281-79053-2
,
9786611790530
,
0-08-086783-9
Series Statement:
Annals of discrete mathematics ; 43
Content:
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.
Note:
Description based upon print version of record.
,
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
,
Chapter 10. On clustering problems with connected optima in Euclidean spacesChapter 11. Some sequences of integers; Chapter 12. 1-Factorizing regular graphs of high degree - An improved bound; Chapter 13. Graphs with small bandwidth and cutwidth; Chapter 14. Simplicial decompositions of graphs: A survey of applications; Chapter 15. On the number of distinct induced subgraphs of a graph; Chapter 16. On the number of partitions of n without a given subsum (I); Chapter 17. The first cycles in an evolving graph; Chapter 18. Covering the complete graph by partitions
,
Chapter 19. A density version of the Hales-Jewett theorem for k = 3Chapter 20. On the path-complete bipartite Ramsey number; Chapter 21. Towards a solution of the Dinitz problem?; Chapter 22. A note on Latin squares with restricted support; Chapter 23. Pseudo-random hypergraphs; Chapter 24. Bouquets of geometric lattices: Some algebraic and topological aspects; Chapter 25. A short proof of a theorem of Vámos on matroid representations; Chapter 26. An on-line graph coloring algorithm with sublinear performance ratio; Chapter 27. The partite construction and Ramsey set systems
,
Chapter 28. Scaffold permutationsChapter 29. Bounds on the measurable chromatic number of Rn; Chapter 30. A simple linear expected time algorithm for finding a hamilton path; Chapter 31. Dense expanders and pseudo-random bipartite graphs; Chapter 32. Forbidden graphs for degree and neighbourhood conditions; List of Contributors; Author Index
,
English
Additional Edition:
ISBN 0-444-87329-5
Language:
English
