1 citations · 1 across the 9 of their papers we have counts for
6 papers · 1 filter
A Local Central Limit Theorem for Clique Counts in Sparse Random Graphs
Asaf Cohen Antonir, Ilay Hoshen, Maksim Zhukovskii
Let denote the number of copies of a fixed graph in . Gilmer and Kopparty conjectured that satisfies a local central limit theorem (LCLT) provided that $H…
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 such that, with high p…
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…
When does a tree activate the random graph?
Asaf Cohen Antonir, Yuval Peled, Asaf Shapira +2
Let and be two graphs. A spanning subgraph of is called weakly -saturated if one can add to the edges of in some order, so that whenever a ne…
Bounding the number of odd paths in planar graphs via convex optimization
Asaf Cohen Antonir, Asaf Shapira
Let denote the maximum number of copies of in an vertex planar graph. The problem of bounding this function for various graphs has been extensive…
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…