Friendship 3-hypergraphs

DOI10.1016/J.DISC.2012.02.025MaRDI QIDQ427832zbMATH OpenOpenAlexFDO

Authors G. H. J. van Rees, Stela H. Seo, N. M. Singhi, 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

boundscomputer algorithmenumerationfriendship 3-hypergraphsfriendship graphgeometric friendship designs

Mathematics Subject Classification ID

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

Recommendations

• On the existence of friendship hypergraphs
• A sharp lower bound on the number of hyperedges in a friendship 3-hypergraph
• On a question of Sós about 3-uniform friendship hypergraphs
• Bounding the number of hyperedges in friendship \(r\)-hypergraphs
• scientific article; zbMATH DE number 1462940

Cites work

• scientific article; zbMATH DE number 3561362 (Why is no real title available?)
• scientific article; zbMATH DE number 2001186 (Why is no real title available?)
• scientific article; zbMATH DE number 2200042 (Why is no real title available?)
• On a question of Sós about 3-uniform friendship hypergraphs
• The CRC handbook of combinatorial designs

Cited in

(9)

• 3-uniform hypergraphs of right ternary near-rings and existence of BIBDs
• A doubling construction for 3-uniform friendship hypergraphs with the universal pairs property
• A sharp lower bound on the number of hyperedges in a friendship 3-hypergraph
• On a question of Sós about 3-uniform friendship hypergraphs
• Bounding the number of hyperedges in friendship \(r\)-hypergraphs
• ZERO-ANNIHILATOR 3-UNIFORM HYPERGRAPHS ASSOCIATED WITH RIGHT TERNARY NEAR-RINGS
• scientific article; zbMATH DE number 7527891 (Why is no real title available?)
• On the existence of friendship hypergraphs
• Digraphs in which every t vertices have exactly common out-neighbors

This page was built for publication: Friendship 3-hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q427832)