A Doubling Construction for 3-Uniform Friendship Hypergraphs with the Universal Pairs Property

In this note, we present a simple doubling construction for 3‐uniform friendship hypergraphs which generalizes the cubeconstructed hypergraphs from another study (L. Jørgensen and A. Sillasen, J Combin Designs (2014)). As a by‐product, we build point‐transitive 3‐uniform friendship hypergraphs of si...

Full description

Saved in:
Bibliographic Details
Published inJournal of combinatorial designs Vol. 24; no. 7; pp. 336 - 339
Main Author Cohen, Nathann
Format Journal Article
LanguageEnglish
Published Hoboken Blackwell Publishing Ltd 01.07.2016
Wiley Subscription Services, Inc
Wiley
Subjects
3-uniform
Combinatorics
Computational Complexity
Computer Science
doubling construction
friendship
Graphs
Mathematics
Online AccessGet full text

Cover

More Information
Summary:In this note, we present a simple doubling construction for 3‐uniform friendship hypergraphs which generalizes the cubeconstructed hypergraphs from another study (L. Jørgensen and A. Sillasen, J Combin Designs (2014)). As a by‐product, we build point‐transitive 3‐uniform friendship hypergraphs of sizes 20·2k and 28·2k for all k≥0.
Bibliography:ark:/67375/WNG-2BN76T82-X
ArticleID:JCD21509
istex:3F7097F24A59B6860A9FCCFEFD0DDF78E3F79A0C
ISSN:1063-8539
1520-6610
DOI:10.1002/jcd.21509