product iamge

Graph Theory and Combinatorics: Proceedings of the Cambridge Combinatorial Conference in Honour of Paul Erdös 1983

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): Béla Bollobás (ed.)
Publisher: Academic Press
Year: 1984

Language: English

Title
List of Contributors
Preface
Contents
1. Paul Erdös: On some problems in graph theory, combinatorial analysis and combinatorial number theory
2. J. C. Bermond, J. Bond, J. F. Saclé: Large hypergraphs of diameter 1
3. A. Bialostocki, J. Schönheim: On some Turán and Ramsey numbers for C_4
4. Béla Bollobás: The evolution of sparse graphs
5. B. Bollobás, T. I. Fenner, A. M. Frieze: Long cycles in sparse random graphs
6. Peter J. Cameron: Aspects of the random graph
7. A. G. Chetwynd, A. J. W. Hilton: Partial edge-colourings of complete graphs or of graphs which are nearly complete
8. David E. Daykin: Antichains of subsets of a finite set
9. David E. Daykin, Peter Frankl: Extremal sets of subsets satisfying conditions induced by a graph
10. David E. Daykin, Roland Häggkvist: Completion of sparse partial Latin squares
11. Peter Donnelly, Dominic Welsh: The antivoter problem: random 2-colourings of graphs
12. Pierre Duchet: Schemes of graphs
13. P. Erdös, R. J. Faudree, C. C. Rousseau, R. H. Schelp: Tree-multipartite graph Ramsey numbers
14. I. P. Goulden, D. M. Jackson: A combinatorial proof of a continued fraction expansion theorem from the Ramanujan notebooks
15. Martin Grötschel: On intersections of longest cycles
16. R. Halin: Simplicial decompositions and triangulated graphs
17. A. J. Harris: Independent cycles in graphs of given minimum degree
18. S. T. Hedetniemi, Renu Laskar: Connected domination in graphs
19. Bernhard Korte, László Lovász: Shelling structures, convexity and a happy end
20. Michel Las Vergnas: A correspondence between spanning trees and orientations in graphs
21. M. Lesk, M. D. Plummer, W. R. Pulleyblank: Equi-matchable graphs
22. Richard Rado: Unisecants of families of sets
23. P. Rosenstiehl: Planar permutations defined by two intersecting Jordan curves
24. J. Sheehan, R. J. Faudree, C. C. Rousseau: A class of size Ramsey problems involving stars
25. Imre Simon: Word Ramsey theorems
26. J. Spencer, E. Szemerédi, W. Trotter, Jr.: Unit distances in the Euclidean plane
27. Carsten Thomassen: Connectivity in tournaments
28. W. T. Tutte: Planar enumeration
29. W. Fernandez de la Vega: On the chromatic number of sparse random graphs