How to contract a vertex transitive 5-connected graph (Q782134): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1155/2020/9315494 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3041215972 / rank | |||
Normal rank | |||
Revision as of 23:24, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How to contract a vertex transitive 5-connected graph |
scientific article |
Statements
How to contract a vertex transitive 5-connected graph (English)
0 references
22 July 2020
0 references
Summary: M. Kriesell conjectured that there existed \(b, h\) such that every 5-connected graph \(G\) with at least \(b\) vertices can be contracted to a 5-connected graph \(G_0\) such that \(0<\left| V \left( G\right)\right|-\left( V \left( G_0\right)\right)<h\). We show that this conjecture holds for vertex transitive 5-connected graphs.
0 references
