𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Conflict free colorings of nonuniform systems of infinite sets

✍ Scribed by Péter Komjáth

Publisher
Akadmiai Kiad
Year
2011
Tongue
English
Weight
386 KB
Volume
133
Category
Article
ISSN
1588-2632

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Infinite Sum-free Sets of Natural Num
On Infinite Sum-free Sets of Natural Numbers
✍ Tomasz łuczak; Tomasz Schoen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 346 KB

A subset of the natural numbers is k-sum-free if it contains no solutions of the equation x 1 + } } } +x k = y, and strongly k-sum-free when it is l-sum-free for every l=2, ..., k. It is shown that every k-sum-free set with upper density larger than 1Â(k+1) is a subset of a periodic k-sum-free set a

Note on large sets of infinite steiner s
Note on large sets of infinite steiner systems
✍ Peter J. Cameron 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 250 KB 👁 1 views

Large sets of Steiner systems s ( t , k , n ) exist for all finite t and k with t < k and all infinite n. The vector space analogues exist over a field F for all finite t and k with f < R provided that either v or F is infinite, and n 1 2k -t + 1. This inequality is best possible. o 1995 John Wiley

Some infinite families of large sets of
Some infinite families of large sets of Kirkman triple systems
✍ Landang Yuan; Qingde Kang 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 1 views

## Abstract A __large set__ of Kirkman triple systems of order __v__, denoted by __LKTS__(__v__), is a collection {(__X__, __B~i~__) : 1 ≤ __i__ ≤ __v__ − 2}, where every (__X__,__B~i~__) is a __KTS__(__v__) and all __B~i~__ form a partition of all triples on __X__. Many researchers have studied th

Stability of the intersection of solutio
Stability of the intersection of solution sets of semi-infinite systems
✍ Miguel A. Goberna; Mercedes Larriqueta; Virginia N. Vera de Serio 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 276 KB

Many mathematical programming models arising in practice present a block structure in their constraint systems. Consequently, the feasibility of these problems depends on whether the intersection of the solution sets of each of those blocks is empty or not. The existence theorems allow to decide whe