Uniform hypergraphs containing no grids (Q390731): 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 / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C42 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05D05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 11B25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6243606 / rank
 
Normal rank
Property / zbMATH Keywords
 
Turán hypergraph problem
Property / zbMATH Keywords: Turán hypergraph problem / rank
 
Normal rank
Property / zbMATH Keywords
 
density problems
Property / zbMATH Keywords: density problems / rank
 
Normal rank
Property / zbMATH Keywords
 
union free hypergraphs
Property / zbMATH Keywords: union free hypergraphs / rank
 
Normal rank
Property / zbMATH Keywords
 
superimposed codes
Property / zbMATH Keywords: superimposed codes / rank
 
Normal rank

Revision as of 15:01, 29 June 2023

scientific article
Language Label Description Also known as
English
Uniform hypergraphs containing no grids
scientific article

    Statements

    Uniform hypergraphs containing no grids (English)
    0 references
    0 references
    0 references
    8 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Turán hypergraph problem
    0 references
    density problems
    0 references
    union free hypergraphs
    0 references
    superimposed codes
    0 references