Bipartitions of highly connected tournaments

DOI10.1016/j.endm.2015.06.013zbMath1346.05094arXiv1411.1533OpenAlexW2357638093MaRDI QIDQ322194

Daniela Kühn, Deryk Osthus, Jae-Hoon Kim

Publication date: 14 October 2016

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.1533

zbMATH Keywords

partitionconnectivitytournamenthighly connected graphsstrongly \(k\)-connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (6)

Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties ⋮ Sparse Spanning $k$-Connected Subgraphs in Tournaments ⋮ Highly linked tournaments ⋮ On 1-factors with prescribed lengths in tournaments ⋮ Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs ⋮ Tournaments and Semicomplete Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Highly linked tournaments
• Partition of graphs with condition on the connectivity and minimum degree
• Hamiltonian-connected tournaments
• Partitions of graphs with high minimum degree or connectivity.
• Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
• Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
• Graph decomposition with constraints on the connectivity and minimum degree
• Graph decomposition with applications to subdivisions and path systems modulo k
• Edge Disjoint Hamiltonian Cycles in Highly Connected Tournaments

This page was built for publication: Bipartitions of highly connected tournaments