Friendship 3-hypergraphs

DOI10.1016/J.DISC.2012.02.025zbMATH Open1243.05180OpenAlexW2124170870MaRDI QIDQ427832FDOQ427832

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

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

zbMATH Keywords

enumerationboundsfriendship graphcomputer algorithmfriendship 3-hypergraphsgeometric friendship designs

Mathematics Subject Classification ID

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

Cites Work

• The CRC handbook of combinatorial designs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On a question of Sós about 3-uniform friendship hypergraphs
• Title not available (Why is that?)

Cited In (5)

• On the Existence of Friendship Hypergraphs
• Bounding the number of hyperedges in friendship \(r\)-hypergraphs
• On a question of Sós about 3-uniform friendship hypergraphs
• ZERO-ANNIHILATOR 3-UNIFORM HYPERGRAPHS ASSOCIATED WITH RIGHT TERNARY NEAR-RINGS
• Title not available (Why is that?)

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)