Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Für diesen Artikel ist leider kein Bild verfügbar.

Directions in Infinite Graph Theory and Combinatorics

With an introduction by C.St.J.A. Nash-Williams

R. Diestel (Herausgeber)

Buch | Hardcover
392 Seiten
1992
North-Holland (Verlag)
978-0-444-89414-4 (ISBN)
CHF 76,75 inkl. MwSt
  • Titel ist leider vergriffen;
    keine Neuauflage
  • Artikel merken
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.

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říž, 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.
Komjáth, 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. Širáň). Fast
Growing Functions Based on Ramsey Theorems (H.J. Prömel, W. Thumser,
B. Voigt). Edge-transitive Strips (M.E. Watkins). Topological Groups and
Infinite Graphs (W. Woess).

Erscheint lt. Verlag 25.3.1992
Reihe/Serie Topics in Discrete Mathematics
Sprache englisch
Themenwelt Mathematik / Informatik Mathematik Graphentheorie
ISBN-10 0-444-89414-4 / 0444894144
ISBN-13 978-0-444-89414-4 / 9780444894144
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Numbers and Counting, Groups, Graphs, Orders and Lattices

von Volker Diekert; Manfred Kufleitner; Gerhard Rosenberger …

Buch | Softcover (2023)
De Gruyter (Verlag)
CHF 89,95