A note on random greedy coloring of uniform hypergraphs (Q3452724): 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 a combinatorial problem. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring uniform hypergraphs with few colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy colorings of uniform hypergraphs / 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: The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(r\)-chromatic hypergraphs / rank
 
Normal rank

Revision as of 02:26, 11 July 2024

scientific article
Language Label Description Also known as
English
A note on random greedy coloring of uniform hypergraphs
scientific article

    Statements

    A note on random greedy coloring of uniform hypergraphs (English)
    0 references
    0 references
    0 references
    13 November 2015
    0 references
    coloring
    0 references
    hypergraph
    0 references
    greedy algorithm
    0 references

    Identifiers

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