Asaf Cohen Antonir

collaborators

5 papers

math.CO2026

Universality in random graphs via optimal linking systems: trees and beyond

Asaf Cohen Antonir, Lyuben Lichev, Maksim Zhukovskii

We develop a framework for proving universality results in sparse random graphs. As a first application, we show that there exists an absolute constant $C > 1$ such that, with high p…

math.PR2026

Upper tails for irregular graphs beyond the mean-field regime

Asaf Cohen Antonir, Matan Harel, Frank Mousset +1

Let $G_{n, p}$ be the binomial random graph of density $p$ and let $X_{H}$ be the number of copies of a fixed graph $H$ in $G_{n, p}$ . We prove asymptotically tight bounds on the logar…

math.NT2026

An Elementary Analysis of the Prime Partition Function

Asaf Cohen Antonir, Asaf Shapira

Let $pp (n)$ denote the number of ways to write $n$ as a sum of primes. In this paper, we show that $lo g pp (n) \sim 2 I ¨ \frac{n}{3 lo g n} .$ While sharper estimates ar…

math.CO2025

Edge inducibility via local directed graphs

Ting-Wei Chao, Asaf Cohen Antonir, Anqi Li +1

In this paper we introduce the edge inducibility problem. This is a common refinement of both the well known Kruskal--Katona theorem and the inducibility question introduced by Pip…

math.CO2025

When does a tree activate the random graph?

Asaf Cohen Antonir, Yuval Peled, Asaf Shapira +2

Let $F$ and $G$ be two graphs. A spanning subgraph $H$ of $G$ is called weakly $F$ -saturated if one can add to $H$ the edges of $G ∖ H$ in some order, so that whenever a ne…