n(k1, k2) equals 2k1 + 2k2 - 4, proving the diagonal case conjecture and establishing the matching lower bound in general.
List Colouring when the Chromatic Number is Close to the Order of the Graph
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
years
2026 5representative citing papers
Symmetric MOD_m circuits require subexponential size to compute n-ary AND, with the bound matched by known depth-2 constructions.
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.
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.
-
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.
-
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.
- Coordinate-View Confusability Graphs and Matroid Rank Certificates