1 citations · 1 across the 1 of their papers we have counts for
2 papers
math.CO2020
Small 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 \emph{proper} colouring of its edges yields a \emph{rainbow} cop…
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…