Hoàng-Reed conjecture holds for tournaments - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2006

Hoàng-Reed conjecture holds for tournaments

Abstract

Hoàng-Reed conjecture asserts that every digraph $D$ has a collection $\cal C$ of circuits $C_1,\dots,C_{\delta ^+}$, where $\delta ^+$ is the minimum outdegree of $D$, such that the circuits of $\cal C$ have a forest-like structure. Formally, $|V(C_i)\cap (V(C_1)\cup \dots \cup V(C_{i-1}))|\leq 1$, for all $i=2,\dots ,\delta^+$. We verify this conjecture for the class of tournaments.
Fichier principal
Vignette du fichier
RR-5976.pdf (226.32 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00091366 , version 1 (06-09-2006)
inria-00091366 , version 2 (15-09-2006)

Identifiers

  • HAL Id : inria-00091366 , version 2

Cite

Frédéric Havet, Stéphan Thomassé, Anders Yeo. Hoàng-Reed conjecture holds for tournaments. [Research Report] RR-5976, INRIA. 2006, pp.7. ⟨inria-00091366v2⟩
137 View
211 Download

Share

Gmail Facebook X LinkedIn More