Inducibility of the net graph

MaRDI QIDQ6858814zbMATH OpenFDO

Authors Adam Blumenthal, Michael Phillips

Publication date 12 February 2026

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://ajc.maths.uq.edu.au/pdf/93/ajc_v93_p290.pdf

zbMATH Keywords

fractalizernumerical optimization techniques

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cites work

• A note on the inducibility of 4-vertex graphs
• C5 ${C}_{5}$ is almost a fractalizer
• Flag algebras
• Further results on the inducibility of d-ary trees
• Inducibility and universality for trees
• Inducibility of \(d\)-ary trees
• Inducibility of directed paths
• Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
• On the exact maximum induced density of almost all graphs and their inducibility
• On the inducibility of oriented graphs on four vertices
• On the Maximum Induced Density of Directed Stars and Related Problems
• Stability from graph symmetrisation arguments with applications to inducibility
• The inducibility of graphs
• The inducibility of graphs on four vertices
• The inducibility of oriented stars
• Turán \(H\)-densities for 3-graphs

Cited in

(1)

• Inducibility of four-vertex tournaments

This page was built for publication: Inducibility of the net graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6858814)