On the minimum number of arcs in k-dicritical oriented graphs - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2022

On the minimum number of arcs in k-dicritical oriented graphs

Résumé

The dichromatic number ⃗ χ(D) of a digraph D is the least integer k such that D can be partitioned into k directed acyclic digraphs. A digraph is k-dicritical if ⃗ χ(D) = k and each proper subgraph D ′ of D satisfies ⃗ χ(D) ≤ k − 1. An oriented graph is a digraph with no directed cycle of length 2. For integers k and n, we denote by o k (n) the minimum number of edges of a k-dicritical oriented graph on n vertices (with the convention o k (n) = +∞ if there is no k-dicritical oriented graph of order n). The main result of this paper is a proof that o 3 (n) ≥ 7n+2 3 together with a construction witnessing that o 3 (n) ≤ 5n 2 for all n ≥ 12. We also give a construction showing that for all sufficiently large n and all k ≥ 3, o k (n) < (2k − 3)n, disproving a conjecture of Hoshino and Kawarabayashi. Finally, we prove that, for all k ≥ 2, o k (n) ≥ k − 3 4 − 1 4k−6 n + 3 4(2k−3) , improving the previous best known lower bound of Bang-Jensen, Bellitto, Schweser and Stiebitz.
Fichier principal
Vignette du fichier
2022_number_of_arcs_in_3_dicritical_oriented_graphs.pdf (434.11 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03985818 , version 1 (13-02-2023)

Identifiants

  • HAL Id : hal-03985818 , version 1

Citer

Pierre Aboulker, Thomas Bellitto, Frédéric Havet, Clément Rambaud. On the minimum number of arcs in k-dicritical oriented graphs. 2023. ⟨hal-03985818⟩
26 Consultations
15 Téléchargements

Partager

Gmail Facebook X LinkedIn More