On small \(n\)-uniform hypergraphs with positive discrepancy

DOI10.1016/J.JCTB.2019.04.001zbMath1428.05224arXiv1706.05539OpenAlexW2962959981MaRDI QIDQ2338645

Danila Cherkashin, Fedor Petrov

Publication date: 21 November 2019

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.05539

zbMATH Keywords

hypergraph coloringshypergraph discrepancyprescribed matrix determinant

Mathematics Subject Classification ID

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

Related Items (9)

The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets ⋮ New bounds on clique-chromatic numbers of Johnson graphs ⋮ 2-colorings of hypergraphs with large girth ⋮ Extremal problems in hypergraph colourings ⋮ New bounds for the clique-chromatic numbers of Johnson graphs ⋮ Lower bounds on the clique-chromatic numbers of some distance graphs ⋮ On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\) ⋮ New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\) ⋮ On non-adaptive majority problems of large query size

Cites Work

• Unnamed Item
• On two-colorings of hypergraphs
• The smallest n-uniform hypergraph with positive discrepancy
• Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs
• Upper bound in the Erdős-Hajnal problem of hypergraph coloring
• A panorama of discrepancy theory
• Geometric discrepancy. An illustrated guide

This page was built for publication: On small \(n\)-uniform hypergraphs with positive discrepancy