n(k1, k2) equals 2k1 + 2k2 - 4, proving the diagonal case conjecture and establishing the matching lower bound in general.
Title resolution pending
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
years
2026 6representative citing papers
Symmetric MOD_m circuits require subexponential size to compute n-ary AND, with the bound matched by known depth-2 constructions.
Every graph contains k vertex-disjoint cycles of distinct lengths or has a set of O(k^6 polylog(k)) vertices whose removal leaves at most k-1 cycle lengths.
Maniplexes are positioned as a unifying combinatorial structure with a proposed edge-labeled graph storage format, demonstrated by linking two regular 4-maniplex datasets to existing graph censuses via canonical forms.
The body derives a polynomial-time matroid upper bound on Shannon capacity for affine coordinate-view graphs and a transitivity criterion, while the abstract's NP-completeness and exact-formula claims are absent from the text.
A dynamic survey reviewing developments in list-coloring and chromatic-choosability, focusing on graph classes with known equality or gaps and the proof methods used.
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.
-
An Erd\H{o}s-P\'osa theorem for cycles and faces of distinct lengths
Every graph contains k vertex-disjoint cycles of distinct lengths or has a set of O(k^6 polylog(k)) vertices whose removal leaves at most k-1 cycle lengths.
-
Maniplexes as a Foundation for Cross-Linked Databases of Symmetric Objects
Maniplexes are positioned as a unifying combinatorial structure with a proposed edge-labeled graph storage format, demonstrated by linking two regular 4-maniplex datasets to existing graph censuses via canonical forms.
-
Coordinate-View Confusability Graphs and Matroid Rank Certificates
The body derives a polynomial-time matroid upper bound on Shannon capacity for affine coordinate-view graphs and a transitivity criterion, while the abstract's NP-completeness and exact-formula claims are absent from the text.
-
List-Coloring and Chromatic-Choosability -- A Dynamic Survey
A dynamic survey reviewing developments in list-coloring and chromatic-choosability, focusing on graph classes with known equality or gaps and the proof methods used.