✦ LIBER ✦

Upper bounds on minimum balanced bipartitions

✍ Scribed by Genghua Fan; Baogang Xu; Xingxing Yu; Chuixiang Zhou

Book ID: 113567528
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 220 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.11.030

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On minimum balanced bipartitions of tria

On minimum balanced bipartitions of triangle-free graphs

✍ Haiyan Li, Yanting Liang, Muhuo Liu, Baogang Xu 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 416 KB

Upper bounds on the minimum distance of

Upper bounds on the minimum distance of spherical codes

✍ Boyvalenkov, P.G.; Danev, D.P.; Bumova, S.P. 📂 Article 📅 1996 🏛 IEEE 🌐 English ⚖ 591 KB

A note on upper bounds for minimum dista

A note on upper bounds for minimum distance codes

✍ D.D. Joshi 📂 Article 📅 1958 🏛 Elsevier Science ⚖ 216 KB

Sign patterns with minimum rank 2 and up

Sign patterns with minimum rank 2 and upper bounds on minimum ranks

✍ Li, Zhongshan; Gao, Yubin; Arav, Marina; Gong, Fei; Gao, Wei; Hall, Frank J.; va 📂 Article 📅 2013 🏛 Taylor and Francis Group 🌐 English ⚖ 159 KB

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

General Upper Bounds on the Minimum Size

General Upper Bounds on the Minimum Size of Covering Designs

✍ Iliya Bluskov; Katherine Heinrich 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 105 KB

Let D be a finite family of k-subsets (called blocks) of a v-set X(v). 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 is the size of the covering, and the minimum size of the covering is called the covering nu