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

Nathann Cohen (1)

1 LRI - Laboratoire de Recherche en Informatique

In this note, we present a simple doubling construction for 3-uniform friendship hypergraphs which generalizes the cubeconstructed hypergraphs from Jørgensen and Sillasen [3]. As a byproduct, we build point-transitive 3-uniform friendship hypergraphs of sizes $20.2^k$ and $28.2^k$ for all $k ≥ 0$.

Domaines: Combinatoire [math.CO]; Complexité [cs.CC]

Nathann Cohen. A Doubling Construction for 3-Uniform Friendship Hypergraphs with the Universal Pairs Property. Journal of Combinatorial Designs, 2016, 24 (7), pp.336-339. ⟨10.1002/jcd.21509⟩. ⟨hal-01316029⟩