For a fixed element x in a triple system with element set V, the neighborhood N(x) of x is the multigraph with vertex set V-\(\{\) \(x\}\) and an edge joining y and z whenever y and z are in a triple with x for all triples in the system. The author proves that for every \(\lambda\), every \(\lambda\)-regular graph meeting certain obvious necessary conditions occurs as a neighborhood in some triple system. He also makes progress on the conjecture that every \(\lambda\)-regular multigraph meeting the same necessary conditions is a neighborhood.
Recommendations
Cites work
Cited in
(7)- Element neighbourhoods in twofold triple systems
- Construction for indecomposable simple \((v, k, \lambda)\)-BIBDs
- Indecomposable triple systems exist for all lambda
- Almost all triple systems with independent neighborhoods are semi-bipartite
- scientific article; zbMATH DE number 4049658 (Why is no real title available?)
- scientific article; zbMATH DE number 91034 (Why is no real title available?)
- Indecomposable \(S_ 6(2,3,v)'s\)
This page was built for publication: Simple neighbourhoods in triple systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q749540)
