A short proof of Halin's grid theorem (Q1766187): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4507228 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph-theoretical versus topological ends of graphs. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Über unendliche Wege in Graphen / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Über die Maximalzahl fremder unendlicher Wege in Graphen / rank | |||
Normal rank | |||
Latest revision as of 19:10, 7 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A short proof of Halin's grid theorem |
scientific article |
Statements
A short proof of Halin's grid theorem (English)
0 references
28 February 2005
0 references
An end of an infinite graph is an equivalence class of rays (1-way infinite paths), where two rays are equivalent if no finite set of vertices separates them. An end is thick if there are infinitely many disjoint rays all converging to that end. In the paper there is a short proof of a theorem by Halin, which states that whenever a graph has a thick end, it has a subgraph isomorphic to a subdivision of a hexagonal grid \(H\) whose rays all belong to that end.
0 references
hexagonal grid
0 references
infinite graph
0 references
ray
0 references
thick end
0 references
