On small \(n\)-uniform hypergraphs with positive discrepancy (Q2338645): Difference between revisions

@@ Property / DOI @@
-.1016/j.jctb.2019.04.001
@@ Property / DOI: 10.1016/j.jctb.2019.04.001 / rank @@
-Normal rank
@@ Property / arXiv ID @@
+.05539
@@ Property / arXiv ID: 1706.05539 / rank @@
+Normal rank
@@ Property / cites work @@
+The smallest n-uniform hypergraph with positive discrepancy
+Normal rank
@@ Property / cites work @@
+Q2798999
@@ Property / cites work: Q2798999 / rank @@
+Normal rank
@@ Property / cites work @@
+Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs
+Normal rank
@@ Property / cites work @@
+A panorama of discrepancy theory
@@ Property / cites work: A panorama of discrepancy theory / rank @@
+Normal rank
@@ Property / cites work @@
+On two-colorings of hypergraphs
@@ Property / cites work: On two-colorings of hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric discrepancy. An illustrated guide
@@ Property / cites work: Geometric discrepancy. An illustrated guide / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bound in the Erdős-Hajnal problem of hypergraph coloring
+Normal rank
@@ Property / DOI @@
+.1016/J.JCTB.2019.04.001
@@ Property / DOI: 10.1016/J.JCTB.2019.04.001 / rank @@
+Normal rank