Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2307.08661

Colouring Digraphs

Guillaume Aubian
View original source ↗Read source document ↗Export metadata ↓

Abstract

The aim of this thesis is to investigate how the structure of a digraph affects its dichromatic number and to extend various results on undirected colouring to digraphs. In the first part of this thesis, we examine how the dichromatic number interacts with other metrics. First, we consider the degree, which is the maximum number of neighbours of a vertex. In the undirected case, this corresponds to Brooks' theorem, a celebrated theorem with multiple variations and generalizations. In the directed case, there is no natural metric corresponding to the maximum degree, so we explore how different notions of maximum directed degree lead to either Brooks-like theorems or impossibility results. We also investigate the maximum local-arc connectivity, a metric that encompasses several degree-like metrics. The second part of this manuscript focuses on a directed analogue of the Gyárfás-Sumner conjecture. The Gyárfás-Sumner conjecture tries to characterize sets S of undirected graphs such that graphs with large enough chromatic number must contain a graph of S. This conjecture is still largely open. On digraphs, a corresponding conjecture was proposed by Aboulker, Charbit, and Naserasr. We prove several subcases of this conjecture, mainly demonstrating that certain classes of digraphs have bounded dichromatic number. In the last part of this thesis, we address the d-edge-defective-colouring problem, which involves colouring edges of a multigraph such that, for any vertex, no colour appears on more than d of its incident edges. When d equals one, this corresponds to the infamous edge-colouring problem. Shannon established a tight bound on the number of colours needed relative to the maximum degree when d equals one, and we extend this result to any value of d. We also explore this problem on simple graphs and prove results that extend Vizing's theorem to any value of d.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Guillaume Aubian. 2023-07-17. Colouring Digraphs. https://arxiv.org/abs/2307.08661

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO↗
arXiv2026

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO↗
arXiv2026

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO↗