The indecomposable tournaments T with |W₅(T)|=|T|-2

DOI10.1016/J.CRMA.2013.07.021MaRDI QIDQ373659zbMATH OpenOpenAlexFDO

Authors Houmem Belkhechine, Imed Boudabbous, Kaouthar Hzami

Publication date 18 October 2013

Published in Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1307.5027, http://www.sciencedirect.com/science/article/pii/S1631073X13001799

zbMATH Keywords

indecompasable tournaments

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Abstract: We consider a tournament $T=(V,A)$. For $XsubseteqV$, the subtournament of $T$ induced by $X$ is $T[X]=(X,Acap(XimesX))$. An interval of $T$ is a subset $X$ of $V$ such that for $a,binX$ and $xinVsetminusX$, $(a,x)inA$ if and only if $(b,x)inA$. The trivial intervals of $T$ are $emptyset$, $x(xinV)$ and $V$. A tournament is indecomposable if all its intervals are trivial. For $ngeq2$, $W_{2n+1}$ denotes the unique indecomposable tournament defined on $0,dots,2n$ such that $W_{2n+1}[0,dots,2n-1]$ is the usual total order. Given an indecomposable tournament $T$, $W_5(T)$ denotes the set of $vinV$ such that there is $WsubseteqV$ satisfying $vinW$ and $T[W]$ is isomorphic to $W_5$. Latka cite{BJL} characterized the indecomposable tournaments $T$ such that $W_5(T)=emptyset$. The authors cite{HIK} proved that if $W_5(T)eqemptyset$, then $mid{W}_5(T)midgeqmidVmid-2$. In this article, we characterize the indecomposable tournaments $T$ such that $mid{W}_5(T)mid=midVmid-2$.

Recommendations

• Subtournaments isomorphic to W₅ in a indecomposable tournament
• SUBTOURNAMENTS ISOMORPHIC TO W₅OF AN INDECOMPOSABLE TOURNAMENT
• Indecomposable tournaments and their indecomposable subtournaments on 5 and 7 vertices
• Recognizing indecomposability for tournaments
• Indecomposable tournaments and their indecomposable subtournaments with six vertices

Cites work

• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• scientific article; zbMATH DE number 3916273 (Why is no real title available?)
• Indecomposable graphs
• Partially critical indecomposable graphs
• Partially critical tournaments and partially critical supports
• Structure theorem for tournaments omitting N₅
• Subtournaments isomorphic to W₅ in a indecomposable tournament
• The indecomposable tournaments T with \(|W_5(T)|=|T|-2\)

Cited in

(9)

• Indecomposable tournaments and their indecomposable subtournaments with six vertices
• The prime tournaments \(T\) with \(|W_{5}(T)| = |T| -2\)
• The indecomposable tournaments T with \(|W_5(T)|=|T|-2\)
• Subtournaments isomorphic to W₅ in a indecomposable tournament
• Structure theorem for tournaments omitting N₅
• SUBTOURNAMENTS ISOMORPHIC TO W₅OF AN INDECOMPOSABLE TOURNAMENT
• Recognizing indecomposability for tournaments
• Indecomposable tournaments and their indecomposable subtournaments on 5 and 7 vertices
• Indecomposable tournaments and their indecomposable subtournaments on 5 vertices

This page was built for publication: The indecomposable tournaments T with \(|W_5(T)|=|T|-2\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q373659)