# The inducibility of blow-up graphs

@article{Hatami2011TheIO, title={The inducibility of blow-up graphs}, author={Hamed Hatami and James Hirst and Serguei Norine}, journal={J. Comb. Theory, Ser. B}, year={2011}, volume={109}, pages={196-212} }

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 every vertex is replaced with the same number of copies, then the resulting graph is called a balanced blow-up.We show that any graph which contains the maximum number of induced copies of a sufficiently large balanced blow-up of H is itself essentially a blow-up of H. This gives an asymptotic answer to a question in… CONTINUE READING

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 18 CITATIONS

## Turán H-Densities for 3-Graphs

VIEW 4 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## A bound on the inducibility of cycles

VIEW 1 EXCERPT

CITES BACKGROUND

## C O ] 4 A ug 2 01 8 A bound on the inducibility of cycles

VIEW 1 EXCERPT

CITES BACKGROUND

## Inducibility of d-ary trees

VIEW 1 EXCERPT

## On the exact maximum induced density of almost all graphs and their inducibility

VIEW 3 EXCERPTS

CITES BACKGROUND

## On the inducibility of rooted trees

VIEW 1 EXCERPT

CITES BACKGROUND

## The edge-statistics conjecture for $\ell \ll k^{6/5}$

VIEW 1 EXCERPT

CITES BACKGROUND

## Inducibility in Binary Trees and Crossings in Random Tanglegrams

VIEW 1 EXCERPT

CITES RESULTS

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 13 REFERENCES