Amanda Redlich

activity

20122022

most citedBalanced Allocation: Patience is not a Virtue

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

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2022

Non-trivial squares and Sidorenko's conjecture

Pranav Garg, Annie Raymond, Amanda Redlich

Let $t (H; G)$ be the homomorphism density of a graph $H$ into a graph $G$ . Sidorenko's conjecture states that for any bipartite graph $H$ , $t (H; G) \geq t (K_{2}; G)^{∣ E (H) ∣}$ for all gra…

math.CO2014

Modular statistics for subgraph counts in sparse random graphs

Bobby DeMarco, Jeff Kahn, Amanda Redlich

Answering a question of Kolaitis and Kopparty, we show that, for given integer $q > 1$ and pairwise nonisomorphic connected graphs $G_{1} ... G_{k}$ , if $p = p (n)$ is such that $\Pr(G_{n,p}…

math.CO2012

Graph decomposition and parity

Bobby DeMarco, Amanda Redlich

Motivated by a recent extension of the zero-one law by Kolaitis and Kopparty, we study the distribution of the number of copies of a fixed disconnected graph in the random graph $G…