A. Razborov

most citedMore about sparse halves in triangle-free graphs

4 citations · 4 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2025

On the Range of the Permanent of $(\pm 1)$ -Matrices

DeVon Ingram, Alexander Razborov

We establish a superpolynomial lower bound on the range of the permanent function on the set of $n \times n$ matrices with $\pm 1$ entries.

math.CO2025

On Domination Exponents for Pairs of Graphs

Grigoriy Blekherman, Annie Raymond, Alexander Razborov +1

Understanding graph density profiles is notoriously challenging. Even for pairs of graphs, complete characterizations are known only in very limited cases, such as edges versus cli…

math.CO2021★ 4 cited

More about sparse halves in triangle-free graphs

Alexander Razborov

One of Erdos's conjectures states that every triangle-free graph on $n$ vertices has an induced subgraph on $n /2$ vertices with at most $n^{2} /50$ edges. We report several partial re…

On the Range of the Permanent of (±1)-Matrices

On Domination Exponents for Pairs of Graphs

More about sparse halves in triangle-free graphs

On the Range of the Permanent of $(\pm 1)$ -Matrices