Inducibility of rainbow graphs

DOI10.1017/S0305004125101692MaRDI QIDQ6877832zbMATH OpenFDO

Authors Emily Cairncross, Clayton M. Mizgerd, Dhruv Mubayi

Publication date 7 January 2026

Published in Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/S0305004125101692

zbMATH Keywords

iterated balanced blow-up of a graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Cites work

• A bound on the inducibility of cycles
• C5 ${C}_{5}$ is almost a fractalizer
• Hypergraph Ramsey numbers
• Kruskal-Katona-type problems via the entropy method
• 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 problem for random Cayley graphs of abelian groups with a few deleted vertices
• On the Maximum Induced Density of Directed Stars and Related Problems
• On the Minimal Density of Triangles in Graphs
• Polynomial to exponential transition in Ramsey theory
• Rainbow triangles in three-colored graphs
• The clique density theorem
• The inducibility of graphs
• The number of cliques in graphs of given order and size

This page was built for publication: Inducibility of rainbow graphs

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