Coloring non-uniform hypergraphs without short cycles (Q742641)

From MaRDI portal
Revision as of 02:14, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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