35 citations · 69 across the 35 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.CO2019★ 1 cited
Large rainbow cliques in randomly perturbed dense graphs
Elad Aigner-Horev, Oran Danon, Dan Hefetz +1
For two graphs and , write if has the property that every {\sl proper} colouring of its edges yields a {\sl rainbow} copy…
math.CO2019★ 1 cited
On the local structure of oriented graphs -- a case study in flag algebras
Shoni Gilboa, Roman Glebov, Dan Hefetz +2
Let be an -vertex oriented graph. Let (respectively ) be the probability that a random set of vertices of spans a transitive triangle (respectively an i…
math.CO2019
Very fast construction of bounded-degree spanning graphs via the semi-random graph process
Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz +1
Semi-random processes involve an adaptive decision-maker, whose goal is to achieve some predetermined objective in an online randomized environment. They have algorithmic implicati…