4 citations · 8 across the 15 of their papers we have counts for
Showing 2018Show 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.CO2018
Edge-statistics on large graphs
Noga Alon, Dan Hefetz, Michael Krivelevich +1
The inducibility of a graph measures the maximum number of induced copies of a large graph can have. Generalizing this notion, we study how many induced subgraphs of fi…