38 citations · 191 across the 25 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.CO2013★ 38 cited
A Note on the Inducibility of 4-vertex Graphs
Chaim Even-Zohar, Nati Linial
There is much recent interest in understanding the density at which constant size graphs can appear in a very large graph. Specifically, the inducibility of a graph H is its extrem…
math.CO2013★ 5 cited
Triply Existentially Complete Triangle-Free Graphs
Chaim Even-Zohar, Nati Linial
A triangle-free graph G is called k-existentially complete if for every induced k-vertex subgraph H of G, every extension of H to a (k+1)-vertex triangle-free graph can be realized…