5 papers
Additive Approximation of Generalized Turán Questions
Noga Alon, Clara Shikhelman
For graphs and , and a family of graphs let denote the maximum possible number of copies of in an -free subgrap…
A generalized Turán problem in random graphs
Wojciech Samotij, Clara Shikhelman
We study the following generalization of the Turán problem in sparse random graphs. Given graphs and , let be the random variable that co…
Semi-random graph process
Omri Ben-Eliezer, Dan Hefetz, Gal Kronenberg +3
We introduce and study a novel semi-random multigraph process, described as follows. The process starts with an empty graph on vertices. In every round of the process, one vert…
-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups
Noga Alon, Clara Shikhelman
We consider the structure of -free subgraphs of graphs with high minimal degree. We prove that for every there exists an so that the following holds. For eve…
On the Converse of Talagrand's Influence Inequality
Saleet Klein, Amit Levi, Muli Safra +2
In 1994, Talagrand showed a generalization of the celebrated KKL theorem. In this work, we prove that the converse of this generalization also holds. Namely, for any sequence of nu…