Combinatorial extremum problems for 2-colorings of hypergraphs (Q2435805): Difference between revisions
From MaRDI portal
Set profile property. |
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: On a combinatorial problem. II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5477816 / 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: Greedy colorings of uniform hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An application of Lovász' local lemma-A new lower bound for the van der Waerden number / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2784326 / rank | |||
Normal rank |
Revision as of 08:45, 7 July 2024
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
20 February 2014
0 references
\(n\)-uniform hypergraph
0 references
2-coloring
0 references
asymptotic lower bound
0 references