7 citations · 12 across the 3 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011★ 7 cited
The Inducibility of Graphs on Four Vertices
James Hirst
We consider the problem of determining the maximum induced density of a graph H in any graph on n vertices. The limit of this density as n tends to infinity is called the inducibil…
math.CO2011★ 5 cited
The inducibility of blow-up graphs
Hamed Hatami, James Hirst, Serguei Norine
The blow-up of a graph is obtained by replacing every vertex with a finite collection of copies so that the copies of two vertices are adjacent if and only if the originals are. If…