Coloring non-uniform hypergraphs without short cycles (Q742641): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On a property of families of sets / 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: Q5477816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a combinatorial problem of P. Erdős and L. Lovasz / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-chromatic 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: Hypergraphs with high chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring uniform hypergraphs with few colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of finite systems of subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy colorings of uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvement of the lower bound in the Erdös-Hajnal combinatorial problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(r\)-chromatic hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring n-sets red and blue / rank
 
Normal rank

Latest revision as of 02:14, 9 July 2024

scientific article
Language Label Description Also known as
English
Coloring non-uniform hypergraphs without short cycles
scientific article

    Statements

    Coloring non-uniform hypergraphs without short cycles (English)
    0 references
    19 September 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    non-uniform hypergraphs
    0 references
    chromatic number
    0 references
    Erdős-Lovász problem
    0 references
    hypergraphs with large girth
    0 references
    0 references