On a question of Sós about 3-uniform friendship hypergraphs

DOI10.1002/jcd.20183zbMath1149.05037OpenAlexW2074355389MaRDI QIDQ3503601

Jennifer Vandenbussche, Stephen G. Hartke

Publication date: 5 June 2008

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.20183

zbMATH Keywords

hypergraphinteger programming3-uniform hypergraphfriendship graphfriendship hypergraphFriendship Theorem

Mathematics Subject Classification ID

Integer programming (90C10) Hypergraphs (05C65)

Related Items (4)

Friendship 3-hypergraphs ⋮ Bounding the number of hyperedges in friendship \(r\)-hypergraphs ⋮ A Doubling Construction for 3-Uniform Friendship Hypergraphs with the Universal Pairs Property ⋮ On the Existence of Friendship Hypergraphs

Uses Software

• CPLEX

Cites Work

• Unnamed Item

This page was built for publication: On a question of Sós about 3-uniform friendship hypergraphs