Hoàng-Reed conjecture holds for tournaments
type: Item
instance of: scholarly article
title: Hoàng-Reed conjecture holds for tournaments
zbMATH Open document ID: 1147.05038
author: Frédéric Havet
author: A. Yeo
author: Stéphan Thomassé
published in: Discrete Mathematics
publication date: 2008-07-11T00:00:00Z
review text: Hoàng-Reed conjecture states that every digraph has a collection of \(m\) circuits, where \(m\) is the minimum out-degree of the digraph, such that these circuits have a forest-like structure. The purpose of the paper is to verify the conjecture for the class of tournaments.
reviewed by: Wai-Kai Chen
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 5300629
zbMATH Keywords: tournament
zbMATH Keywords: triangle structure
zbMATH Keywords: digraph
MaRDI profile type: Publication
full work available at URL: j.disc.2007.06.033
OpenAlex ID: W1976532920
Wikidata QID: Q122966913
cites work: Q4192089
cites work: Cycles in multipartite tournaments
cites work: A note on short cycles in digraphs
cites work: Vertex deletion and cycles in multipartite tournaments
cites work: The 2-linkage problem for acyclic digraphs
DOI: 10.1016/J.DISC.2007.06.033
description: scientific article; zbMATH DE number 5300629