✦ LIBER ✦

On Score Sequences ofk-Hypertournaments

✍ Scribed by Zhou Guofei; Yao Tianxing; Zhang Kemin

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 92 KB
Volume: 21
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.2000.0393

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Score sequences of oriented graphs

✍ Peter Avery 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 349 KB

## Abstract We extend Landau's concept of the score structure of a tournament to that of the score sequence of an oriented graph, and give a condition for an arbitrary integer sequence to be a score sequence. The proof is by construction of a specific oriented graph Δ(__S__) with given score sequen

Score sequences: Lexicographic enumerati

Score sequences: Lexicographic enumeration and tournament construction

✍ S.V. Gervacio 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 289 KB

Vertex-pancyclicity of hypertournaments

✍ Jed Yang 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB

## Abstract A hypertournament or a __k__‐tournament, on __n__ vertices, 2≤__k__≤__n__, is a pair __T__=(__V, E__), where the vertex set __V__ is a set of size __n__ and the edge set __E__ is the collection of all possible subsets of size __k__ of __V__, called the edges, each taken in one of its __

Transitive partitions in realizations of

Transitive partitions in realizations of tournament score sequences

✍ Arthur H. Busch; Guantao Chen; Michael S. Jacobson 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB

## Abstract A tournament is an oriented complete graph, and one containing no directed cycles is called __transitive__. A tournament __T__=(__V, A__) is called __m__‐__partition transitive__ if there is a partition such that the subtournaments induced by each __X__~__i__~ are all transitive, an

Observations on Fermat Motives ofK3-Type

✍ Fernando Q Gouvêa; Noriko Yui 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 378 KB

In , Zarhin introduced the notion of varieties of K 3-type in even dimension over finite fields. Zarhin showed that ordinary abelian surfaces, ordinary K3 surfaces, and ordinary cubic fourfolds are examples of such varieties. As Zarhin already points out, it is easy to extend his method to define mo

Hamiltonian paths and cycles in hypertou

Hamiltonian paths and cycles in hypertournaments

✍ Gutin, Gregory; Yeo, Anders 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB

Given two integers n and k, n ≥ k > 1, a k-hypertournament T on n vertices is a pair (V, A), where V is a set of vertices, |V | = n and A is a set of k-tuples of vertices, called arcs, so that for any k-subset S of V, A contains exactly one of the k! k-tuples whose entries belong to S. A 2-hypertour