Simple neighbourhoods in triple systems

Research output: Contribution to journalArticle

3 Citations (Scopus)

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

Fingerprint

Triple System
Unordered
Multigraph
Regular Graph
Simple Graph
Congruence
Necessary
Design

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Simple neighbourhoods in triple systems. / Colbourn, Charles.

In: Journal of Combinatorial Theory, Series A, Vol. 52, No. 1, 1989, p. 10-19.

Research output: Contribution to journalArticle

@article{0598aa46e4534ce4b92c12a445c6ed4a,
title = "Simple neighbourhoods in triple systems",
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.",
author = "Charles Colbourn",
year = "1989",
doi = "10.1016/0097-3165(89)90058-7",
language = "English (US)",
volume = "52",
pages = "10--19",
journal = "Journal of Combinatorial Theory - Series A",
issn = "0097-3165",
publisher = "Academic Press Inc.",
number = "1",

}

TY - JOUR

T1 - Simple neighbourhoods in triple systems

AU - Colbourn, Charles

PY - 1989

Y1 - 1989

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

VL - 52

SP - 10

EP - 19

JO - Journal of Combinatorial Theory - Series A

JF - Journal of Combinatorial Theory - Series A

SN - 0097-3165

IS - 1

ER -