Sparse hypergraphs with low independence number (Q1705800): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On Turan's theorem for sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal uncrowded hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dense infinite Sidon sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring H-free hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List coloring triangle-free hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of simple triangle-free triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound for Heilbronn'S Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Parity-Check Matrices over ${GF(q)}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: An intersection theorem for four sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3027024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence number of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turan's theorem for \(k\)-graphs / rank
 
Normal rank

Latest revision as of 07:48, 15 July 2024

scientific article
Language Label Description Also known as
English
Sparse hypergraphs with low independence number
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references