𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The minimal covering set in large tournaments

✍ Scribed by Alex Scott; Mark Fey

Publisher
Springer
Year
2010
Tongue
English
Weight
143 KB
Volume
38
Category
Article
ISSN
0176-1714

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Computing the minimal covering set
Computing the minimal covering set
✍ Felix Brandt; Felix Fischer πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 540 KB
On large minimal blocking sets in PG(2,q
On large minimal blocking sets in PG(2,q)
✍ TamΓ‘s SzΕ‘nyi; Antonello Cossidente; AndrΓ‘s GΓ‘cs; Csaba MengyΓ‘n; Alessandro Sicil πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 172 KB πŸ‘ 1 views

## Abstract The size of large minimal blocking sets is bounded by the Bruen–Thas upper bound. The bound is sharp when __q__ is a square. Here the bound is improved if __q__ is a non‐square. On the other hand, we present some constructions of reasonably large minimal blocking sets in planes of non‐p