Smallest 3-graphs having a 3-colored edge in every k-coloring (Q1258312)

From MaRDI portal
Revision as of 02:25, 13 June 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
Smallest 3-graphs having a 3-colored edge in every k-coloring
scientific article

    Statements

    Smallest 3-graphs having a 3-colored edge in every k-coloring (English)
    0 references
    0 references
    1979
    0 references
    0 references
    0 references
    0 references
    0 references
    Hypergraphs
    0 references
    Colorings
    0 references
    Extremal Problems
    0 references
    3-Graph
    0 references
    0 references
    0 references
    0 references
    0 references