A note on two-colorability of nonuniform hypergraphs (Q5002721): 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: Q5724800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a combinatorial problem. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of 3-chromatic hypergraphs with few edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083461 / 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: Around Erdős-Lovász problem on colorings of non-uniform hypergraphs / rank
 
Normal rank

Latest revision as of 07:43, 26 July 2024

scientific article; zbMATH DE number 7375973
Language Label Description Also known as
English
A note on two-colorability of nonuniform hypergraphs
scientific article; zbMATH DE number 7375973

    Statements

    0 references
    0 references
    0 references
    28 July 2021
    0 references
    0 references
    property B
    0 references
    nonuniform hypergraphs
    0 references
    hypergraph coloring
    0 references
    random greedy coloring
    0 references
    math.CO
    0 references
    cs.DM
    0 references
    cs.DS
    0 references
    0 references