On a result of Thomassen (Q2809211)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On a result of Thomassen |
scientific article; zbMATH DE number 6586360
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a result of Thomassen |
scientific article; zbMATH DE number 6586360 |
Statements
On a result of Thomassen (English)
0 references
27 May 2016
0 references
graph
0 references
subgraph
0 references
chromatic number
0 references
edge-connectivity
0 references
outdegree
0 references
0 references
0 references
0 references
0.8007662
0 references
0 references
0 references
\textit{C. Thomassen} recently proved [Combinatorica 37, No. 4, 785--793 (2017; Zbl 1413.05124)] that each graph with uncountable chromatic number has a subgraph which also has uncountable chromatic number as well as infinite edge-connectivity. He also proved that, if each orientation of a given graph has a vertex of infinite outdegree, then the graph has an uncountable subgraph of infinite edge-connectivity.NEWLINENEWLINEThe author of the present article offers new proofs of Thomassen's results.
0 references
