The binomial random graph is a bad inducer

DOI10.1002/RSA.70067MaRDI QIDQ7240421zbMATH OpenFDO

Authors Vishesh Jain, Marcus Michelen, Fan Wei

Publication date 11 May 2026

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/RSA.70067

zbMATH Keywords

feasible regionsinducibility of graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)

Cites work

• A note on the inducibility of 4-vertex graphs
• scientific article; zbMATH DE number 2132158 (Why is no real title available?)
• scientific article; zbMATH DE number 4216032 (Why is no real title available?)
• scientific article; zbMATH DE number 3900799 (Why is no real title available?)
• scientific article; zbMATH DE number 3188526 (Why is no real title available?)
• Large networks and graph limits
• Limits of dense graph sequences
• Multiplicities of subgraphs
• On the Ramsey multiplicities of graphs—problems and recent results
• The feasible region of induced graphs
• The inducibility of graphs

This page was built for publication: The binomial random graph is a bad inducer

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