A family of reduced graphs W_k (k≥5) with inertia (binomial(k,2)+1, 0, k-1) provides counterexamples to the conjecture 2n+(G) ≤ n-(G)(n-(G)+1) and also refutes a weaker variant.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Counterexamples to a conjecture on graph inertia
A family of reduced graphs W_k (k≥5) with inertia (binomial(k,2)+1, 0, k-1) provides counterexamples to the conjecture 2n+(G) ≤ n-(G)(n-(G)+1) and also refutes a weaker variant.