Bounding the number of hyperedges in friendship \(r\)-hypergraphs (Q499453): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
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

Revision as of 23:55, 30 June 2023

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
    0 references
    0 references
    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

    Identifiers