Indecomposability and duality of tournaments
type: Item
instance of: scholarly article
title: Indecomposability and duality of tournaments
zbMATH Open document ID: 0968.05036
DOI: 10.1016/S0012-365X(00)00040-6
author: Youssef Boudabbous
author: Jamel Dammak
author: P. Ille
published in: Discrete Mathematics
publication date: 2001-05-10T00:00:00Z
review text: The authors say that a tournament \(T\) with \(n\) vertices is indecomposable if its vertex set cannot be partitioned into \(k\) subsets, where \(2\leq k\leq n-1\), in such a way that all of the arcs between any pair of subsets have the same orientation. They characterize tournaments \(T\) with the property that every proper subtournament of \(T\) that is indecomposable is also self-dual. They also consider the problem of reconstructing tournaments from their proper indecomposable subtournaments.
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 1538198
zbMATH Keywords: reconstruction
zbMATH Keywords: tournament
zbMATH Keywords: self-dual
zbMATH Keywords: indecomposable subtournaments
reviewed by: J. W. Moon
MaRDI profile type: Publication
Wikidata QID: Q126438081
full work available at URL: s0012-365x(00)00040-6
OpenAlex ID: W2111789324
Recommended article: Q4963201
Recommended article: Tournaments with maximal decomposability
Recommended article: Decomposability and co-modular indices of tournaments
Recommended article: Configurations inévitables dans un tournoi indécomposable
Recommended article: Decomposability index of tournaments
Recommended article: Dichotomy for finite tournaments of mixed-type
Recommended article: The \(\{-2,-1\}\)-selfdual and decomposable tournaments
Recommended article: Q4854730
Recommended article: Q4677912
Recommended article: A note on decompositions of transitive tournaments
description: scientific article; zbMATH DE number 1538198