1 citations · 1 across the 3 of their papers we have counts for
4 papers
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…
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…
Exact Limit Theorems for Restricted Integer Partitions
Asaf Cohen Antonir, Asaf Shapira
For a set of positive integers , let denote the number of ways to write as a sum of integers from , and let denote the usual partition function. In the ea…