The Minimum Number of Edges in Uniform Hypergraphs with Property O (Q3177361): 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 3-chromatic hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on random greedy coloring of uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4088856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Probabilistic Graph-Theoretical Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds and algorithms for hypergraph 2-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring n-sets red and blue / rank
 
Normal rank

Revision as of 05:24, 16 July 2024

scientific article
Language Label Description Also known as
English
The Minimum Number of Edges in Uniform Hypergraphs with Property O
scientific article

    Statements

    The Minimum Number of Edges in Uniform Hypergraphs with Property O (English)
    0 references
    0 references
    0 references
    0 references
    24 July 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    oriented \(k\)-uniform hypergraph
    0 references
    0 references