Abstract
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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 10-19 |
| Number of pages | 10 |
| Journal | Journal of Combinatorial Theory, Series A |
| Volume | 52 |
| Issue number | 1 |
| DOIs | |
| State | Published - Sep 1989 |
| Externally published | Yes |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
Fingerprint
Dive into the research topics of 'Simple neighbourhoods in triple systems'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS