Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

The Covering Numbers \(g_{3}^{(4)}(v)\)

R.G. Stanton1
1Department of Computer Science University of Manitoba Winnipeg, Canada R3T 2N2
  • Published: 29/02/2004

Abstract

The number \( g_3^{(4)}(v) \) represents the minimum cardinality of a pairwise balanced design on \( v \) elements in which the largest block size is four and every pair occurs exactly three times. We give a survey of the results for this quantity.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
R.G. Stanton. The Covering Numbers \(g_{3}^{(4)}(v)\)[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 048. 107-114. DOI: .