Annie Raymond

most citedProof of the Erdős-Simonovits conjecture on walks

2 citations · 2 across the 2 of their papers we have counts for

collaborators

3 papers

math.CO2020★ 2 cited

Proof of the Erdős-Simonovits conjecture on walks

Grigoriy Blekherman, Annie Raymond

Let $G^{n}$ be a graph on $n$ vertices and let $w_{k} (G^{n})$ denote the number of walks of length $k$ in $G^{n}$ divided by $n$ . Erdős and Simonovits conjectured that $w_k(G^n)^t \geq w_t…

math.CO2020

The Linear Relaxation of an Integer Program for the Union-Closed Conjecture

Brianna Amaral, Lucien Dalton, Drew Polakowski +2

The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets…

math.CO2018

Simple Graph Density Inequalities with no Sum of Squares Proofs

Grigoriy Blekherman, Annie Raymond, Mohit Singh +1

Establishing inequalities among graph densities is a central pursuit in extremal combinatorics. A standard tool to certify the nonnegativity of a graph density expression is to wri…