Combinatorial extremum problems for 2-colorings of hypergraphs (Q2435805)

From MaRDI portal
Revision as of 08:10, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Combinatorial extremum problems for 2-colorings of hypergraphs
scientific article

    Statements

    Combinatorial extremum problems for 2-colorings of hypergraphs (English)
    0 references
    0 references
    20 February 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    \(n\)-uniform hypergraph
    0 references
    2-coloring
    0 references
    asymptotic lower bound
    0 references