Showing 2018Show all
3 papers · 1 filter
math.CO2018
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…
math.CO2018
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…
math.CO2018
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…