Ebook: Cycles and Rays

What is the "archetypal" image that comes to mind when one thinks of an infinite graph? What with a finite graph - when it is thought of as opposed to an infinite one? What structural elements are typical for either - by their presence or absence - yet provide a common ground for both? In planning the workshop on "Cycles and Rays" it had been intended from the outset to bring infinite graphs to the fore as much as possible. There never had been a graph theoretical meeting in which infinite graphs were more than "also rans", let alone one in which they were a central theme. In part, this is a matter of fashion, inasmuch as they are perceived as not readily lending themselves to applications, in part it is a matter of psychology stemming from the insecurity that many graph theorists feel in the face of set theory - on which infinite graph theory relies to a considerable extent. The result is that by and large, infinite graph theorists know what is happening in finite graphs but not conversely. Lack of knowledge about infinite graph theory can also be found in authoritative l sources. For example, a recent edition (1987) of a major mathematical encyclopaedia proposes to ". . . restrict [itself] to finite graphs, since only they give a typical theory". If anything, the reverse is true, and needless to say, the graph theoretical world knows better. One may wonder, however, by how much.

---

---

Content:
Front Matter....Pages iii-iii
Linkability in Countable-Like Webs....Pages 1-8
Decomposition into Cycles I: Hamilton Decompositions....Pages 9-18
An Order- and Graph-Theoretical Characterisation of Weakly Compact Cardinals....Pages 19-20
Small Cycle Double Covers of Graphs....Pages 21-40
?-Transformations, Local Complementations and Switching....Pages 41-50
Two Extremal Problems in Infinite Ordered Sets and Graphs: Infinite Versions of Menger and Gallai-Milgram Theorems for Ordered Sets and Graphs....Pages 51-74
Chv?tal-Erd?s Theorem For Digraphs....Pages 75-86
Long Cycles and the Codiameter of a Graph II....Pages 87-94
Compatible Euler Tours In Eulerian Digraphs....Pages 95-100
Edge-Colouring Graphs and Embedding Partial Triple Systems of Even Index....Pages 101-112
On the Rank of Fixed Point Sets of Automorphisms of Free Groups....Pages 113-122
On Transition Polynomials of 4-Regular Graphs....Pages 123-150
On Infinite n-Connected Graphs....Pages 151-160
Ordered Graphs Without Infinite Paths....Pages 161-180
Ends of Infinite Graphs, Potential Theory and Electrical Networks....Pages 181-196
Topological Aspects of Infinite Graphs....Pages 197-220
Dendroids, End-Separators, and Almost Circuit-Connected Trees....Pages 221-236
Partition Theorems for Graphs Respecting the Chromatic Number....Pages 237-242
Vertex-Transitive Graphs That Are Not Cayley Graphs....Pages 243-256
Back Matter....Pages 257-259

---

Content:
Front Matter....Pages iii-iii
Linkability in Countable-Like Webs....Pages 1-8
Decomposition into Cycles I: Hamilton Decompositions....Pages 9-18
An Order- and Graph-Theoretical Characterisation of Weakly Compact Cardinals....Pages 19-20
Small Cycle Double Covers of Graphs....Pages 21-40
?-Transformations, Local Complementations and Switching....Pages 41-50
Two Extremal Problems in Infinite Ordered Sets and Graphs: Infinite Versions of Menger and Gallai-Milgram Theorems for Ordered Sets and Graphs....Pages 51-74
Chv?tal-Erd?s Theorem For Digraphs....Pages 75-86
Long Cycles and the Codiameter of a Graph II....Pages 87-94
Compatible Euler Tours In Eulerian Digraphs....Pages 95-100
Edge-Colouring Graphs and Embedding Partial Triple Systems of Even Index....Pages 101-112
On the Rank of Fixed Point Sets of Automorphisms of Free Groups....Pages 113-122
On Transition Polynomials of 4-Regular Graphs....Pages 123-150
On Infinite n-Connected Graphs....Pages 151-160
Ordered Graphs Without Infinite Paths....Pages 161-180
Ends of Infinite Graphs, Potential Theory and Electrical Networks....Pages 181-196
Topological Aspects of Infinite Graphs....Pages 197-220
Dendroids, End-Separators, and Almost Circuit-Connected Trees....Pages 221-236
Partition Theorems for Graphs Respecting the Chromatic Number....Pages 237-242
Vertex-Transitive Graphs That Are Not Cayley Graphs....Pages 243-256
Back Matter....Pages 257-259
....