Asaf Cohen Antonir

activity

20212026

most citedThe upper tail problem for induced 4-cycles in sparse random graphs

1 citations · 1 across the 9 of their papers we have counts for

collaborators

9 papers

math.CO2026

A Local Central Limit Theorem for Clique Counts in Sparse Random Graphs

Asaf Cohen Antonir, Ilay Hoshen, Maksim Zhukovskii

Let $X_{H}$ denote the number of copies of a fixed graph $H$ in $G_{n, p}$ . Gilmer and Kopparty conjectured that $X_{H}$ satisfies a local central limit theorem (LCLT) provided that $H…

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 π \frac{n}{3 lo g n} .$ While sharper estimates are…

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…

math.CO2022

Bounding the number of odd paths in planar graphs via convex optimization

Asaf Cohen Antonir, Asaf Shapira

Let $N_{P} (n, H)$ denote the maximum number of copies of $H$ in an $n$ vertex planar graph. The problem of bounding this function for various graphs $H$ has been extensive…

math.CO2022★ 1 cited

The upper tail problem for induced 4-cycles in sparse random graphs

Asaf Cohen Antonir

Building on the techniques from the breakthrough paper of Harel, Mousset and Samotij, which solved the upper tail problem for cliques, we compute the asymptotics of the upper tail…

math.NT2021

Exact Limit Theorems for Restricted Integer Partitions

Asaf Cohen Antonir, Asaf Shapira

For a set of positive integers $A$ , let $p_{A} (n)$ denote the number of ways to write $n$ as a sum of integers from $A$ , and let $p (n)$ denote the usual partition function. In the ea…