Theory of finite and infinite graphs
Theory of finite and infinite graphs
复制标题
DOI:
10.1007/978-1-4684-8971-2_2
复制
发表时间:
1990
期刊:
影响因子:
--
通讯作者:
D. König
中科院分区:
文献类型:
--
作者:
D. König
Foreword Graph theory can be conceived from two different standpoints. First, like the theory of one dimensional complexes, it forms the first part of general topology. Secondly, it can be conceived, if one abstracts from its continuous-geometrical content, as a branch of combinatorics and abstract set theory. This book takes the second standpoint mainly because we do not ascribe to the elements of graphs, points and edges, any geometrical content at all: the points (vertices) are arbitrary distinguishable elements, and an edge is nothing other than a collection of its two endpoints. This abstract conception, which Sylvester emphasized (1873), will be strictly adhered to in our presentation, with the exception of several examples and applications. The geometrical notation, which we nevertheless use, gives a very convenient terminology without assuming any geometrical view or geometrical axioms. This graph theoretical terminology has a great heuristic value: it furnishes" natural" problems and connects quite abstract things with clear ideas, whereby new connections among concepts and problems seemingly distant from one another often come to light. Also this abstract-combinatorial conception is of advantage for geometrical topology, as is shown by the great development that multidimensional combinatorial (Poincare-Veblen) topology has experienced in recent times. Certainly for complexes and manifolds of more than one dimension the avoidance of the" continuous" is connected with greater difficulties. For this reason we restrict ourselves, in order to preserve the quite elementary character of this book, to absolute graph theory, which considers graphs in themselves, while