A short proof of Halin's grid theorem (Q1766187)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2139436
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A short proof of Halin's grid theorem |
scientific article; zbMATH DE number 2139436 |
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
0.8686837553977966
0 references
0.8562989234924316
0 references
0.7748161554336548
0 references
0.7567344903945923
0 references
0.7510496973991394
0 references
