✦ LIBER ✦

A Combinatorial Problem in Matching

✍ Scribed by Kalbfleisch, J. G.; Stanton, R. G.

Book ID: 120097082
Publisher: Oxford University Press
Year: 1969
Tongue: English
Weight: 138 KB
Volume: s1-44
Category: Article
ISSN: 0024-6107
DOI: 10.1112/jlms/s1-44.1.60

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Corrigendum: A Combinatorial Problem in

Corrigendum: A Combinatorial Problem in Matching

✍ Kalbfleisch, J. G.; Stanton, R. G. 📂 Article 📅 1969 🏛 Oxford University Press 🌐 English ⚖ 16 KB

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial Pattern Matching Volume 1075 || A 2 2/3-approximation algorithm for the shortest superstring problem

✍ Hirschberg, Dan; Myers, Gene 📂 Article 📅 1996 🏛 Springer Berlin Heidelberg ⚖ 837 KB

Solving (large scale) matching problems

Solving (large scale) matching problems combinatorially

✍ U. Derigs; A. Metz 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 394 KB

A combinatorial problem

✍ J. A. Thas 📂 Article 📅 1973 🏛 Springer 🌐 English ⚖ 177 KB

A Combinatorial Proof for the Football P

A Combinatorial Proof for the Football Pool Problem for Six Matches

✍ Patric R.J. Östergård 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 171 KB

Consider the set F 6 3 of all 6-tuples x 0 x 1 x 2 x 3 x 4 x 5 with x i # [0, 1, 2]. It is known that there is a subset C of F 6 3 with 73 elements such that, for any x # F 6 3 , there is a word in C that differs from x in at most one coordinate. We show that there exists such a set C with a clear s

A combinatorial problem in pharmacology

✍ George H. Weiss; John Rice 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 301 KB