The smallest n-uniform hypergraph with positive discrepancy

DOI10.1007/BF02579446zbMath0629.05053MaRDI QIDQ1093653

P. D. Seymour, Daniel J. Kleitman, Carl B. Pomerance, Michael E. Saks, Noga Alon

Publication date: 1987

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

hypergraphdiscrepancyvertex coloringtwo coloring

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items

Path choosability of planar graphs, Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory, Choosability and fractional chromatic numbers, Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs, Extremal problems in hypergraph colourings, On small \(n\)-uniform hypergraphs with positive discrepancy, On non-adaptive majority problems of large query size

Cites Work

• Unnamed Item
• Discrepancy of set-systems and matrices
• Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory
• ``Integer-making theorems
• Balanced two-colorings of finite sets in the square. I
• Six Standard Deviations Suffice
• ON THE ‘HIGH-INDICES THEOREM’ OF HARDY AND LITTLEWOOD