Every skew Hamming set-pair system at threshold t has at most 2^(t+1) pairs, and this bound is tight.
F¨ uredi, Geometrical solution of an intersection problem for two hypergraphs
1 Pith paper cite this work, alongside 38 external citations. Polarity classification is still indexing.
1
Pith paper citing it
38
external citations · OpenAlex
fields
math.CO 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Tight bound for the skew Hamming set-pair problem
Every skew Hamming set-pair system at threshold t has at most 2^(t+1) pairs, and this bound is tight.