Combinatorial extremum problems for 2-colorings of hypergraphs (Q2435805): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:19, 2 February 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
