Les tournois (-1)-critiques

Details Les tournois (-1)-critiques Les tournois (-1)-critiques

2010-07-16

arxiv.org/abs/1007.2726v1

Mathematics

Combinatorics

14 pages,Communications in Mathematical Analysis Volume 3, Number 2, pp. 83-97, 2007 Procceedings of the 15th Symposium of The

Scientific paper

Given a tournament T=(V,A), a subset X of V is an interval of T provided that for any a, b\in X and x\in V-X, (a,x) \in A if and only if (b,x)\in A. For example, \emptyset, \{x\} (x\in V) and V are intervals of T, called trivial intervals. A tournament, all the intervals of which are trivial, is indecomposable; otherwise, it is decomposable. A vertex x of an indecomposable tournament is critical if T-x is decomposable. In 1993, J.H. Schmerl and W.T. Trotter characterized the tournaments, all the vertices of which are critical, called critical tournaments. The cardinality of these tournaments is odd. Given an odd integer m \geq 5, there exist three critical tournaments of cardinality . and there are exactly three critical tournaments for each such a cardinality. In this article, we characterize the tournaments which admit a single non critical vertex, that we call (-1)-critical tournaments. The cardinality of these tournaments is odd. Given an odd integer m \geq 7, there exist 3m-15 (-1)-critical tournaments of cardinality m.

Affiliated with

Also associated with

No associations

Rating

Les tournois (-1)-critiques does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Les tournois (-1)-critiques, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Les tournois (-1)-critiques will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-50800