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