TY - JOUR
T1 - Simple neighbourhoods in triple systems
AU - Colbourn, Charles J.
N1 - Funding Information:
Thanks to Brendan McKay and Alex Rosa for helpful discussions. This research was partially supported by NSERC Canada under Grant A0579 and was undertaken in part while visiting at the University of Auckland.
PY - 1989/9
Y1 - 1989/9
N2 - The neighbourhood of an element in a triple system of index λ is the λ-regular multigraph whose edges are the unordered pairs appearing in triples with the fixed element. We prove, for every λ, that every λ-regular simple graph meeting the necessary congruence and density conditions appears as the neighbourhood of an element. Applications in design theory are given.
AB - The neighbourhood of an element in a triple system of index λ is the λ-regular multigraph whose edges are the unordered pairs appearing in triples with the fixed element. We prove, for every λ, that every λ-regular simple graph meeting the necessary congruence and density conditions appears as the neighbourhood of an element. Applications in design theory are given.
UR - http://www.scopus.com/inward/record.url?scp=38249005103&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38249005103&partnerID=8YFLogxK
U2 - 10.1016/0097-3165(89)90058-7
DO - 10.1016/0097-3165(89)90058-7
M3 - Article
AN - SCOPUS:38249005103
SN - 0097-3165
VL - 52
SP - 10
EP - 19
JO - Journal of Combinatorial Theory, Series A
JF - Journal of Combinatorial Theory, Series A
IS - 1
ER -