Directions in infinite graph theory and combinatorics

Bibliographic Information

Directions in infinite graph theory and combinatorics

[edited by] R. Diestel ; with an introduction by C. St. D.A. Nash-Williams

(Topics in discrete mathematics, 3)

North-Holland , Sole distributors for the USA and Canada, Elsevier Science Pub. Co., 1992

Other Title

Infinite graph theory

Available at  / 17 libraries

Search this Book/Journal

Note

Includes references and index

Description and Table of Contents

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.

Table of Contents

Infinite Matching Theory (R. Aharoni). Gallai-Milgram Properties for Infinite Graphs (J.-M. Brochet, M. Pouzet). The Age of a Relational Structure (P.J. Cameron). Decomposing Infinite Graphs (R. Diestel). Bounded Graphs (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 i , R. Thomas). Matchings from a Set Below to a Set Above (P. Erd s, J.A. Larson). A Partition Relation for Triples Using a Model of Todor evi (E.C. Milner, K. Prikry). Some Relations 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). Universal Elements and the Complexity of Certain Classes of Infinite Graphs (P. Komjath, J. Pach). Asymmetrising Sets in Trees (N. Polat, G. Sabidussi). Asymmetrization of Infinite Trees (N. Polat). Excluding Infinite Minors (N. Robertson, P. Seymour, R. Thomas). An End-Faithful Spanning Tree Counterexample (P. Seymour, R. Thomas). End-faithful Forests and Spanning Trees in Infinite Graphs (J. Sira ). Fast Growing Functions Based on Ramsey Theorems (H.J. Proemel, W. Thumser, B. Voigt). Edge-transitive Strips (M.E. Watkins). Topological Groups and Infinite Graphs (W. Woess).

by "Nielsen BookData"

Related Books: 1-1 of 1

Details

  • NCID
    BA14194077
  • ISBN
    • 0444894144
  • LCCN
    91042351
  • Country Code
    ne
  • Title Language Code
    eng
  • Text Language Code
    eng
  • Place of Publication
    Amsterdam ; Tokyo,New York, N.Y., USA
  • Pages/Volumes
    385 p.
  • Size
    27 cm
  • Classification
  • Subject Headings
  • Parent Bibliography ID
Page Top