On infinite bridged graphs and strongly dismantlable graphs (Q1969784): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q593214 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Michael Hager / rank | |||
Normal rank |
Revision as of 20:49, 19 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On infinite bridged graphs and strongly dismantlable graphs |
scientific article |
Statements
On infinite bridged graphs and strongly dismantlable graphs (English)
0 references
26 April 2001
0 references
A graph \(G\) is called strongly dismantlable if its vertices can be linearly ordered \((x_0,\dots, x_\alpha)\) such that for each ordinal \(\beta< \alpha\) there exists a strictly increasing finite sequence \((i_j)_{0\leq j\leq n}\) of ordinals with \(i_0=\beta\), \(i_n= \alpha\) and \(x_{i_{j+1}}\) is adjacent to \(x_{i_j}\) and to all neighbors of \(x_{i_j}\) in the induced subgraph of \(G(\{x_\gamma\mid \beta\leq \gamma\leq \alpha\})\). The author proves that if a connected bridged graph \(G\) contains no infinite simplices and the vertex set of each ray of \(G\) contains an infinite bounded subset, then \(G\) is strongly dismantlable. Using this result he extends results in Helly-type theorems for bridged graphs; see i.e. \textit{N. Polat} [ibid. 140, No. 1-3, 119-127 (1995; Zbl 0828.05062)].
0 references
strongly dismantlable graphs
0 references
bridged graph
0 references