Coloring non-uniform hypergraphs without short cycles (Q742641)

From MaRDI portal
Revision as of 19:51, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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