Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments (Q2922881): Difference between revisions

@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6303030
@@ Property / zbMATH Open document ID @@
+.05081
@@ Property / zbMATH Open document ID: 1291.05081 / rank @@
+Normal rank
@@ Property / publication date @@
+June 2014Timestamp +2014-06-11T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2014-06-11T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 11 June 2014 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6303030
@@ Property / zbMATH DE Number: 6303030 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+strongly \(f(k)\)-connected tournament
@@ Property / zbMATH Keywords: strongly \(f(k)\)-connected tournament / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Thomassen's conjecture
@@ Property / zbMATH Keywords: Thomassen's conjecture / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2133832791
@@ Property / OpenAlex ID: W2133832791 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q123082537
@@ Property / Wikidata QID: Q123082537 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.4213
@@ Property / arXiv ID: 1303.4213 / rank @@
+Normal rank
@@ Property / arXiv classification @@
+math.CO
@@ Property / arXiv classification: math.CO / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting in \(c \log n\) parallel steps
@@ Property / cites work: Sorting in \(c \log n\) parallel steps / rank @@
+Normal rank
@@ Property / cites work @@
+Q3815328
@@ Property / cites work: Q3815328 / rank @@
+Normal rank
@@ Property / cites work @@
+Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
+Normal rank
@@ Property / cites work @@
+A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs
+Normal rank
@@ Property / cites work @@
+Highly linked graphs
@@ Property / cites work: Highly linked graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3267901
@@ Property / cites work: Q3267901 / rank @@
+Normal rank
@@ Property / cites work @@
+Counting and packing Hamilton cycles in dense graphs and oriented graphs
+Normal rank
@@ Property / cites work @@
+The directed subgraph homeomorphism problem
@@ Property / cites work: The directed subgraph homeomorphism problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4398780
@@ Property / cites work: Q4398780 / rank @@
+Normal rank
@@ Property / cites work @@
+Triangle Factors in Random Graphs
@@ Property / cites work: Triangle Factors in Random Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree
+Normal rank
@@ Property / cites work @@
+A survey on Hamilton cycles in directed graphs
@@ Property / cites work: A survey on Hamilton cycles in directed graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
+Normal rank
@@ Property / cites work @@
+Hamilton decompositions of regular expanders: applications
+Normal rank
@@ Property / cites work @@
+Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
+Normal rank
@@ Property / cites work @@
+On Subtournaments of a Tournament
@@ Property / cites work: On Subtournaments of a Tournament / rank @@
+Normal rank
@@ Property / cites work @@
+Improved sorting networks with O(log N) depth
@@ Property / cites work: Improved sorting networks with O(log N) depth / rank @@
+Normal rank
@@ Property / cites work @@
+A Dirac-Type Theorem for 3-Uniform Hypergraphs
@@ Property / cites work: A Dirac-Type Theorem for 3-Uniform Hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+An improved linear edge bound for graph linkages
@@ Property / cites work: An improved linear edge bound for graph linkages / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments
+Normal rank
@@ Property / cites work @@
+Highly connected non-2-linked digraphs
@@ Property / cites work: Highly connected non-2-linked digraphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2922881