17 citations · 47 across the 21 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
math.CO2020
On sparse random combinatorial matrices
Elad Aigner-Horev, Yury Person
Let denote the random combinatorial matrix whose rows are independent of one another and such that each row is sampled uniformly at random from the subset of vectors in $…
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.CO2020
Rainbow Hamilton cycles in randomly coloured randomly perturbed dense graphs
Elad Aigner-Horev, Dan Hefetz
Given an -vertex graph with minimum degree at least for some fixed , the distribution over the supergraphs of is referred to as a (…