Bounding the number of hyperedges in friendship \(r\)-hypergraphs (Q499453): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C65 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6487461 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
friendship graph | |||
Property / zbMATH Keywords: friendship graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
friendship 3-hypergraphs | |||
Property / zbMATH Keywords: friendship 3-hypergraphs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
geometric friendship designs | |||
Property / zbMATH Keywords: geometric friendship designs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
bounds | |||
Property / zbMATH Keywords: bounds / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
computer algorithm | |||
Property / zbMATH Keywords: computer algorithm / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
enumeration | |||
Property / zbMATH Keywords: enumeration / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1606891175 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1412.5822 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On generalized graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5520566 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hypergraph regularity and the multidimensional Szemerédi theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a question of Sós about 3-uniform friendship hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Friendship Theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Existence of Friendship Hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2866605 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Friendship 3-hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5654053 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The counting lemma for regular <i>k</i>‐uniform hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Regularity Lemma for k-uniform hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4133991 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5632577 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 19:56, 10 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bounding the number of hyperedges in friendship \(r\)-hypergraphs |
scientific article |
Statements
Bounding the number of hyperedges in friendship \(r\)-hypergraphs (English)
0 references
30 September 2015
0 references
friendship graph
0 references
friendship 3-hypergraphs
0 references
geometric friendship designs
0 references
bounds
0 references
computer algorithm
0 references
enumeration
0 references