Friendship 3-hypergraphs

A friendship 3-hypergraph is a 3-hypergraph in which for any 3 distinct vertices u, v and w, there exists a unique fourth vertex x such that uvx, uwx, vwx are 3-hyperedges. Sós constructed friendship 3-hypergraphs using Steiner triple systems. Hartke and Vandenbussche showed that any friendship 3-hy...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete mathematics 2012-06, Vol.312 (11), p.1892-1899
Hauptverfasser:	Li, P.C., van Rees, G.H.J., Seo, Stela H., Singhi, N.M.
Format:	Artikel
Sprache:	eng
Schlagworte:	Construction Design engineering Enumeration Friendship 3-hypergraphs Friendship graph Geometric friendship designs, bounds, computer algorithm Mathematical analysis Refining Searching Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!