5 citations · 6 across the 7 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2018
Two Erdős--Hajnal-type Theorems in Hypergraphs
Michal Amir, Asaf Shapira, Mykhaylo Tyomkyn
The Erdős--Hajnal Theorem asserts that non-universal graphs, that is, graphs that do not contain an induced copy of some fixed graph , have homogeneous sets of size significantl…
math.CO2017★ 1 cited
Ramsey-nice families of graphs
Ron Aharoni, Noga Alon, Michal Amir +5
For a finite family of fixed graphs let be the smallest integer for which every -coloring of the edges of the complete graph yields a…