On a conjecture of Thomassen (Q2517648): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1410.4902 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2784326 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3491608 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3808121 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:20, 10 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a conjecture of Thomassen |
scientific article |
Statements
On a conjecture of Thomassen (English)
0 references
27 August 2015
0 references
Summary: In 1989, \textit{C. Thomassen} [in: Combinatorial mathematics, Proc. 3rd Int. Conf., New York/ NY (USA) 1985, Ann. N. Y. Acad. Sci. 555, 402--412 (1989; Zbl 0709.05030)] asked whether there is an integer-valued function \(f(k)\) such that every \(f(k)\)-connected graph admits a spanning, bipartite \(k\)-connected subgraph. In this paper we take a first, humble approach, showing the conjecture is true up to a \(\log n\) factor.
0 references
graph connectivity
0 references
digraphs
0 references
Thomassen
0 references
