Friendship 3-hypergraphs

DOI10.1016/j.disc.2012.02.025zbMath1243.05180OpenAlexW2124170870MaRDI QIDQ427832

Stela H. Seo, G. H. J. van Rees, Navin M. Singhi, (Ben) P. C. Li

Publication date: 18 June 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.02.025

zbMATH Keywords

boundsenumerationcomputer algorithmfriendship graphfriendship 3-hypergraphsgeometric friendship designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Hypergraphs (05C65) Enumeration in graph theory (05C30)

Related Items (4)

ZERO-ANNIHILATOR 3-UNIFORM HYPERGRAPHS ASSOCIATED WITH RIGHT TERNARY NEAR-RINGS ⋮ Bounding the number of hyperedges in friendship \(r\)-hypergraphs ⋮ Unnamed Item ⋮ On the Existence of Friendship Hypergraphs

Cites Work

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

This page was built for publication: Friendship 3-hypergraphs