On small \(n\)-uniform hypergraphs with positive discrepancy (Q2338645): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The smallest n-uniform hypergraph with positive discrepancy / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2798999 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A panorama of discrepancy theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On two-colorings of hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Geometric discrepancy. An illustrated guide / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Upper bound in the Erdős-Hajnal problem of hypergraph coloring / rank | |||
Normal rank |
Revision as of 01:00, 21 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On small \(n\)-uniform hypergraphs with positive discrepancy |
scientific article |
Statements
On small \(n\)-uniform hypergraphs with positive discrepancy (English)
0 references
21 November 2019
0 references
hypergraph colorings
0 references
hypergraph discrepancy
0 references
prescribed matrix determinant
0 references