𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New Upper Bound on the Transversal Width of T(3)-Families of Discs

✍ Scribed by Aladár Heppes

Publisher
Springer
Year
2005
Tongue
English
Weight
250 KB
Volume
34
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New upper bounds on the decomposability
New upper bounds on the decomposability of planar graphs
✍ Fedor V. Fomin; Dimitrios M. Thilikos 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 335 KB 👁 1 views

## Abstract It is known that a planar graph on __n__ vertices has branch‐width/tree‐width bounded by $\alpha \sqrt {n}$. In many algorithmic applications, it is useful to have a small bound on the constant α. We give a proof of the best, so far, upper bound for the constant α. In particular, for th

New upper bounds on the minimum size of
New upper bounds on the minimum size of covering designs
✍ Iliya Bluskov; Heikki Hämäläinen 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 1 views

Let D = {B1 , B2 , . . . , B b } be a finite family of k-subsets (called blocks) of a vset X(v) = {1, 2, . . . , v} (with elements called points). Then D is a (v, k, t) covering design or covering if every t-subset of X(v) is contained in at least one block of D. The number of blocks, b, is the size