On the size of partial block designs with large blocks

A. Sárközy, Gábor N. Sárközy

Research output: Contribution to journalArticle

Abstract

A t-(n,k,λ) design is a k-uniform hypergraph with the property that every set of t vertices is contained in exactly λ of the edges (blocks). A partial t-(n,k,λ) design is a k-uniform hypergraph with the property that every set of t vertices is contained in at most λ edges; or equivalently the intersection of every set of λ+1 blocks contains fewer than t elements. Let us denote by fλ(n,k,t) the maximum size of a partial t-(n,k,λ) design. We determine fλ(n,k,t) as a fundamental problem in design theory and in coding theory. In this paper we provide some new bounds for fλ(n,k,t).

Original languageEnglish
Pages (from-to)264-275
Number of pages12
JournalDiscrete Mathematics
Volume305
Issue number1-3
DOIs
Publication statusPublished - Dec 6 2005

Fingerprint

Block Design
Partial
Uniform Hypergraph
Coding Theory
Intersection
Denote
Design

Keywords

  • Partial block designs

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

On the size of partial block designs with large blocks. / Sárközy, A.; Sárközy, Gábor N.

In: Discrete Mathematics, Vol. 305, No. 1-3, 06.12.2005, p. 264-275.

Research output: Contribution to journalArticle

Sárközy, A. ; Sárközy, Gábor N. / On the size of partial block designs with large blocks. In: Discrete Mathematics. 2005 ; Vol. 305, No. 1-3. pp. 264-275.
@article{1d432974580541e99f3dcdcfe04b0871,
title = "On the size of partial block designs with large blocks",
abstract = "A t-(n,k,λ) design is a k-uniform hypergraph with the property that every set of t vertices is contained in exactly λ of the edges (blocks). A partial t-(n,k,λ) design is a k-uniform hypergraph with the property that every set of t vertices is contained in at most λ edges; or equivalently the intersection of every set of λ+1 blocks contains fewer than t elements. Let us denote by fλ(n,k,t) the maximum size of a partial t-(n,k,λ) design. We determine fλ(n,k,t) as a fundamental problem in design theory and in coding theory. In this paper we provide some new bounds for fλ(n,k,t).",
keywords = "Partial block designs",
author = "A. S{\'a}rk{\"o}zy and S{\'a}rk{\"o}zy, {G{\'a}bor N.}",
year = "2005",
month = "12",
day = "6",
doi = "10.1016/j.disc.2005.09.014",
language = "English",
volume = "305",
pages = "264--275",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - On the size of partial block designs with large blocks

AU - Sárközy, A.

AU - Sárközy, Gábor N.

PY - 2005/12/6

Y1 - 2005/12/6

N2 - A t-(n,k,λ) design is a k-uniform hypergraph with the property that every set of t vertices is contained in exactly λ of the edges (blocks). A partial t-(n,k,λ) design is a k-uniform hypergraph with the property that every set of t vertices is contained in at most λ edges; or equivalently the intersection of every set of λ+1 blocks contains fewer than t elements. Let us denote by fλ(n,k,t) the maximum size of a partial t-(n,k,λ) design. We determine fλ(n,k,t) as a fundamental problem in design theory and in coding theory. In this paper we provide some new bounds for fλ(n,k,t).

AB - A t-(n,k,λ) design is a k-uniform hypergraph with the property that every set of t vertices is contained in exactly λ of the edges (blocks). A partial t-(n,k,λ) design is a k-uniform hypergraph with the property that every set of t vertices is contained in at most λ edges; or equivalently the intersection of every set of λ+1 blocks contains fewer than t elements. Let us denote by fλ(n,k,t) the maximum size of a partial t-(n,k,λ) design. We determine fλ(n,k,t) as a fundamental problem in design theory and in coding theory. In this paper we provide some new bounds for fλ(n,k,t).

KW - Partial block designs

UR - http://www.scopus.com/inward/record.url?scp=28544444002&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=28544444002&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2005.09.014

DO - 10.1016/j.disc.2005.09.014

M3 - Article

VL - 305

SP - 264

EP - 275

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -