17 citations · 47 across the 21 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
An Asymmetric Random Rado Theorem: 1-statement
Elad Aigner-Horev, Yury Person
A classical result by Rado characterises the so-called partition-regular matrices , i.e.\ those matrices for which any finite colouring of the positive integers yields a mon…
cs.DS2019★ 12 cited
Envy-free Matchings in Bipartite Graphs and their Applications to Fair Division
Elad Aigner-Horev, Erel Segal-Halevi
A matching in a bipartite graph with parts X and Y is called envy-free if no unmatched vertex in X is a adjacent to a matched vertex in Y. Every perfect matching is envy-free, but…