No label defined (Q4028434)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 140059
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 140059 |
Statements
28 March 1993
0 references
non-symmetric configurations
0 references
deficiency
0 references
Steiner system
0 references
0.7876508831977844
0 references
0.7820507287979126
0 references
0.780769407749176
0 references
[For the entire collection see Zbl 0748.00018.] A configuration is a finite incidence structure with \(v\) points and \(b\) lines (or blocks) such that each line contains \(k\) points, each point lies on \(r\) lines, two distinct lines meet in at most one point, and two distinct points are contained in at most one line. If \(v=b\) (and hence \(r=k\)), the configuration is called symmetric. Configurations with \(k=2\) are \(r\)-regular (simple) graphs on \(v\) vertices. The deficiency \(d\) of a configuration is defined by \(d=v-r(k-1)-1\). Thus each point is not connected to exactly \(d\) other points, and the deficiency is a measure of how much the configuration differs from a Steiner system. The paper under review is a step towards showing the existence of a configuration with \(k=4\) and any admissible set of parameters \((vr=bk\), \(v\leq b\), and \(v\geq r(k-1)+1)\). The main emphasis is on configurations with small deficiency. Known results about divisible designs, regular packings of complete graphs and resolvable configurations are frequently used.
0 references