Ohr Kadrawi

collaborators

2 papers

math.CO2026

Annihilation, Independence, and Residue: Sharp Matching Bounds for the Annihilation Gap and a TxGraffiti Application

Ohr Kadrawi, Vadim E. Levit

Let $G$ be a finite simple graph. The annihilation number $a (G)$ is an efficiently computable upper bound on the independence number $I^\pm (G)$ . We develop a sharp matching-number the…

math.CO2026

Closing Trees into Unicyclic Counterexamples

Vadim E. Levit, Ohr Kadrawi

We develop a family-based route to unicyclic graphs whose independence polynomials are unimodal but not log-concave. The paper is organized around one flagship statement: for the e…