Directions in Infinite Graph Theory and Combinatorics
With an introduction by C.St.J.A. Nash-Williams
Published on 6. June 2016
392 pages
978-1-4832-9479-7 (ISBN)
Description
This book has arisen from a colloquium held at St. John's College, Cambridge, in July 1989, which brought together most of today's leading experts in the field of infinite graph theory and combinatorics. This was the first such meeting ever held, and its aim was to assess the state of the art in the discipline, to consider its links with other parts of mathematics, and to discuss possible directions for future development. This volume reflects the Cambridge meeting in both level and scope. It contains research papers as well as expository surveys of particular areas. Together they offer a comprehensive portrait of infinite graph theory and combinatorics, which should be particularly attractive to anyone new to the discipline.
More details
Other editions
Additional editions
R. Diestel
Directions in Infinite Graph Theory and Combinatorics: Volume 3
With an introduction by C.St.J.A. Nash-Williams
Book
03/1992
North-Holland
€54.46
Article exhausted; check different version
Content
Infinite Matching Theory (R. Aharoni). Gallai-Milgram Properties forInfinite Graphs (J.-M. Brochet, M. Pouzet). The Age of a RelationalStructure (P.J. Cameron). Decomposing Infinite Graphs (R. Diestel). BoundedGraphs (R. Halin). A Survey on Graphs with Polynomial Growth (W. Imrich, N.Seifter). Some Results on Ends and Automorphisms of Graphs (H.A. Jung).Analyzing Nash-Williams' Partition Theorem by Means of Ordinal Types (I.Kříž, R. Thomas). Matchings from a Set Below to a SetAbove (P. Erdős, J.A. Larson). A Partition Relation for Triples Usinga Model of Todorčević (E.C. Milner, K. Prikry). SomeRelations Between Analytic and Geometric Properties of Infinite Graphs (B.Mohar). Reconstruction of Infinite Graphs (C.St.J.A. Nash-Williams).f-Optimal Factors of Infinite Graphs (F. Niedermeyer). UniversalElements and the Complexity of Certain Classes of Infinite Graphs (P.Komjáth, J. Pach). Asymmetrising Sets in Trees (N. Polat, G.Sabidussi). Asymmetrization of Infinite Trees (N. Polat). ExcludingInfinite Minors (N. Robertson, P. Seymour, R. Thomas). An End-FaithfulSpanning Tree Counterexample (P. Seymour, R. Thomas). End-faithful Forestsand Spanning Trees in Infinite Graphs (J. siráň). FastGrowing Functions Based on Ramsey Theorems (H.J. Prömel, W. Thumser,B. Voigt). Edge-transitive Strips (M.E. Watkins). Topological Groups andInfinite Graphs (W. Woess).
