The following pages link to The inducibility of blow-up graphs (Q462932):
Displaying 18 items.
- A note on the inducibility of 4-vertex graphs (Q497330) (← links)
- Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle (Q896063) (← links)
- A bound on the inducibility of cycles (Q1621427) (← links)
- Strong forms of stability from flag algebra calculations (Q1719577) (← links)
- On blow-ups and injectivity of quivers (Q1953529) (← links)
- On the inducibility of oriented graphs on four vertices (Q2138968) (← links)
- The edge-statistics conjecture for \(\ell \ll k^{6/5} \) (Q2279950) (← links)
- Inducibility of \(d\)-ary trees (Q2279994) (← links)
- Maximising the number of induced cycles in a graph (Q2399349) (← links)
- On the exact maximum induced density of almost all graphs and their inducibility (Q2421550) (← links)
- Further results on the inducibility of $d$-ary trees (Q5026962) (← links)
- Inducibility and universality for trees (Q5051466) (← links)
- Inducibility in Binary Trees and Crossings in Random Tanglegrams (Q5348495) (← links)
- The Inducibility of Graphs on Four Vertices (Q5417819) (← links)
- On the 3‐Local Profiles of Graphs (Q5495884) (← links)
- On the inducibility of cycles (Q5916268) (← links)
- Stability from graph symmetrisation arguments with applications to inducibility (Q6096814) (← links)
- Extremal (balanced) blow-ups of trees with respect to the signless Laplacian index (Q6106030) (← links)
