Every skew Hamming set-pair system at threshold t has at most 2^(t+1) pairs, and this bound is tight.
Bollob´ as, On generalized graphs, Acta Mathematica Academiae Scientiarum Hungaricae16(1965)
1 Pith paper cite this work, alongside 392 external citations. Polarity classification is still indexing.
1
Pith paper citing it
392
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.