We deal with two types of buildups of 3-configurations: a generating buildup over a given edge set and a regulated one (according to maximal relative degrees of vertices over a penetrable set of vertices). Then we take account to minimal generating edge sets, i.e., to edge bases. We also deduce the fundamental relation between the numbers of all vertices, of all edges from edge basis and of all terminal elements. The topic is parallel to a certain part of Belousov' “Configurations in algebraic nets” edited in 1979. We attempt to find an apparatus, which, beside others, will decode some less readible chapters of the monograph [1], and which can be useful by further study of 3-configurations with simple edge bases and of corresponding quasigroup identities.
@article{107491,
author = {V\'aclav J. Havel},
title = {Regulated buildups of 3-configurations},
journal = {Archivum Mathematicum},
volume = {030},
year = {1994},
pages = {17-24},
zbl = {0811.05017},
mrnumber = {1282109},
language = {en},
url = {http://dml.mathdoc.fr/item/107491}
}
Havel, Václav J. Regulated buildups of 3-configurations. Archivum Mathematicum, Tome 030 (1994) pp. 17-24. http://gdmltest.u-ga.fr/item/107491/
Configurations in algebraic nets, (in Russian), Kishinev (1979). (1979) | MR 0544665
Bases of web configuration, Publ. de l’ Inst. Math. Beograd, 38 (1985), 21–30. (1985) | MR 0837378