Simple neighbourhoods in triple systems

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


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 languageEnglish (US)
Pages (from-to)10-19
Number of pages10
JournalJournal of Combinatorial Theory, Series A
Issue number1
StatePublished - Sep 1989
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'Simple neighbourhoods in triple systems'. Together they form a unique fingerprint.

Cite this