Establishes n^{1-ε}-hardness of approximation for dichromatic number and acyclic number on tournaments, plus polynomial-time approximations for ℓ-dicolorable digraphs and special dense cases.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
The switching class of A_A(G) = D^T D - 2I determines G modulo isolates, and its frustration index equals 1/4 sum d(v)^2 minus 1/4 the maximum ||Dx||^2 over sign vectors x on edges, yielding spectral bounds on bipartization.
citing papers explorer
-
Hardness and Approximation for Coloring Digraphs
Establishes n^{1-ε}-hardness of approximation for dichromatic number and acyclic number on tournaments, plus polynomial-time approximations for ℓ-dicolorable digraphs and special dense cases.
-
The Antisymmetric Line Graph
The switching class of A_A(G) = D^T D - 2I determines G modulo isolates, and its frustration index equals 1/4 sum d(v)^2 minus 1/4 the maximum ||Dx||^2 over sign vectors x on edges, yielding spectral bounds on bipartization.