Bounding the number of hyperedges in friendship \(r\)-hypergraphs

DOI10.1016/j.ejc.2015.05.002zbMath1321.05172arXiv1412.5822OpenAlexW1606891175MaRDI QIDQ499453

Karen Gunderson, Jason Semeraro, Natasha Morrison

Publication date: 30 September 2015

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.5822

zbMATH Keywords

boundsenumerationcomputer algorithmfriendship graphfriendship 3-hypergraphsgeometric friendship designs

Mathematics Subject Classification ID

Hypergraphs (05C65)

Related Items (1)

Symmetry in domination for hypergraphs with choice

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Friendship 3-hypergraphs
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• On a question of Sós about 3-uniform friendship hypergraphs
• The Friendship Theorem
• Regularity Lemma for k-uniform hypergraphs
• On the Existence of Friendship Hypergraphs
• The counting lemma for regular k‐uniform hypergraphs
• On generalized graphs

This page was built for publication: Bounding the number of hyperedges in friendship \(r\)-hypergraphs