Opening book details…
Can I read On an Adjacency Property of Almost All Tournaments on EtoBox?
On an Adjacency Property of Almost All Tournaments by Anthony Bonato; Kathie Cameron is a Computer Science article available to read on EtoBox.
What is On an Adjacency Property of Almost All Tournaments about?
Let n be a positive integer. A tournament is called n-existentially closed (or n-e.c.) if for every subset S of n vertices and for every subset T of S, there is a vertex x / ∈ S which is directed toward every vertex in T and directed away from every vertex in S\T . We prove that there is a 2-e.c. tournament with k vertices if and only if k ≥ 7 and k = 8, and give explicit examples for all such orders k. We also give a replication operation which preserves the 2-e.c. property.
Who reads On an Adjacency Property of Almost All Tournaments?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Anthony Bonato; Kathie Cameron
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0012-365X)
- Published
- 2006
- Language
- EN
- Field
- Computer Science (Physical Sciences)