✦ LIBER ✦

A Note on a Packing Problem in Transitive Tournaments

✍ Scribed by Agnieszka Görlich; Monika Pilśniak; Mariusz Woźniak

Book ID: 106047584
Publisher: Springer Japan
Year: 2006
Tongue: English
Weight: 114 KB
Volume: 22
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-005-0652-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on decompositions of transitive t

A note on decompositions of transitive tournaments

✍ Agnieszka Görlich; Rafał Kalinowski; Mariusz Meszka; Monika Pilśniak; Mariusz Wo 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 177 KB

Packing Transitive Triples in a Tourname

Packing Transitive Triples in a Tournament

✍ Mohamad Kabiya; Raphael Yuster 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 271 KB

A note on modelling tournaments

✍ Winston T. H. Koh 📂 Article 📅 1992 🏛 Springer Vienna 🌐 English ⚖ 501 KB

A Note on Transitive Equivalence

✍ John Hickman 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB

A note on an open-end bin packing proble

A note on an open-end bin packing problem

✍ Joseph Y.-T. Leung; Moshe Dror; Gilbert H. Young 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 71 KB 👁 1 views

We consider a variant of the classical one-dimensional bin packing problem, which we call the open-end bin packing problem. Suppose that we are given a list L = (p 1 ; p 2 ; : : : ; pn) of n pieces, where p j denotes both the name and the size of the jth piece in L, and an inÿnite collection of inÿn

On a conjecture of Brualdi and Shen on b

On a conjecture of Brualdi and Shen on block transitive tournaments

✍ P. Acosta; A. Bassa; A. Chaikin; A. Riehl; A. Tingstad; L. Zhao; D. J. Kleitman 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB

## Abstract The following conjecture of Brualdi and Shen is proven in this paper: let __n__ be partitioned into natural numbers no one of which is greater than (__n__ + 1) / 2. Then, given any sequence of wins for the players of some tournament among n players, there is a partition of the players i