n(k1, k2) equals 2k1 + 2k2 - 4, proving the diagonal case conjecture and establishing the matching lower bound in general.
‘Constructing Ramsey graphs from Boolean function representations’
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Symmetric MOD_m circuits require subexponential size to compute n-ary AND, with the bound matched by known depth-2 constructions.
Matroid certificates from coordinate ranks bound zero-error confusability capacity; realizable relations are upward-closed agreement families, with host realizability equivalent to zero-delay synchronization plus side information.
citing papers explorer
-
Sharp bounds for covering with large cliques and independent sets
n(k1, k2) equals 2k1 + 2k2 - 4, proving the diagonal case conjecture and establishing the matching lower bound in general.
-
Optimal Lower Bounds for Symmetric Modular Circuits
Symmetric MOD_m circuits require subexponential size to compute n-ary AND, with the bound matched by known depth-2 constructions.
-
Zero-Error Recovery under Deterministic Partial Views: Matroid Bounds and Verifiable Realizability
Matroid certificates from coordinate ranks bound zero-error confusability capacity; realizable relations are upward-closed agreement families, with host realizability equivalent to zero-delay synchronization plus side information.