Skip to Main content Skip to Navigation

Substructures in digraphs

William Lochet 1
1 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : The main purpose of the thesis was to exhibit sufficient conditions on digraphs to find subdivisions of complex structures. While this type of question is pretty well understood in the case of (undirected) graphs, few things are known for the case of directed graphs (also called digraphs). The most notorious conjecture is probably the one due to Mader in 1985. He asked if there exists a function f such that every digraph with minimum outdegree at least f(k) contains a subdivision of the transitive tournament on k vertices. The conjecture is still wide open as even the existence of f(5) remains open. This thesis presents some weakening of this conjecture. Among other results, we prove that digraphs with large minimum outdegree contain large in-arborescences. We also prove that digraphs with large minimum outdegree contain large transitive tournaments as immersions, which was conjectured by DeVos et al. in 2011. Changing the parameter, we also prove that large chromatic number can force subdivision of cycles and other structures in strongly connected digraphs. This thesis also presents the proof of the Erd\H{o}s-Sands-Sauer-Woodrow conjecture that states that the domination number of tournaments whose arc set can be partitioned into k transitive digraphs only depends on k. The conjecture, asked in 1982, was still open for k=3. Finally this thesis presents proofs for two results, one about orientation of hypergraphs and the other about AVD colouring using the recently developed probabilistic technique of entropy compression.
Document type :
Complete list of metadata

Cited literature [78 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Thursday, January 10, 2019 - 2:13:06 PM
Last modification on : Monday, October 12, 2020 - 10:30:40 AM
Long-term archiving on: : Thursday, April 11, 2019 - 3:50:11 PM


Version validated by the jury (STAR)


  • HAL Id : tel-01957030, version 2



William Lochet. Substructures in digraphs. Combinatorics [math.CO]. Université Côte d'Azur, 2018. English. ⟨NNT : 2018AZUR4052⟩. ⟨tel-01957030v2⟩



Record views


Files downloads