35 citations · 69 across the 35 of their papers we have counts for
Showing 2018 · math.COShow all
2 papers · 2 filters
math.CO2018
Edge-statistics on large graphs
Noga Alon, Dan Hefetz, Michael Krivelevich +1
The inducibility of a graph measures the maximum number of induced copies of a large graph can have. Generalizing this notion, we study how many induced subgraphs of fi…
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…