The inducibility of graphs

DOI10.1016/0095-8956(75)90084-2zbMath0332.05119OpenAlexW2025617285MaRDI QIDQ1227631

Martin Charles Golumbic, Nicholas J. Pippenger

Publication date: 1975

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(75)90084-2

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (36)

A bound on the inducibility of cycles ⋮ Some exact results for generalized Turán problems ⋮ Inducibility and universality for trees ⋮ On the inducibility of oriented graphs on four vertices ⋮ Maximising the number of induced cycles in a graph ⋮ The inducibility of complete bipartite graphs ⋮ Inducibility in Binary Trees and Crossings in Random Tanglegrams ⋮ C5 ${C}_{5}$ is almost a fractalizer ⋮ On the maximum number of odd cycles in graphs without smaller odd cycles ⋮ On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices ⋮ On the exact maximum induced density of almost all graphs and their inducibility ⋮ Stability from graph symmetrisation arguments with applications to inducibility ⋮ Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle ⋮ Further results on the inducibility of $d$-ary trees ⋮ Extremal problems in hypergraph colourings ⋮ Planar graphs with the maximum number of induced 6-cycles ⋮ Inducibility in the hypercube ⋮ Strong forms of stability from flag algebra calculations ⋮ The inducibility of blow-up graphs ⋮ A note on the inducibility of 4-vertex graphs ⋮ Maximum density of vertex-induced perfect cycles and paths in the hypercube ⋮ On the inducibility of cycles ⋮ On the Erdős-Hajnal problem for 3-graphs ⋮ On the inducibility of cycles ⋮ The edge-statistics conjecture for \(\ell \ll k^{6/5} \) ⋮ Inducibility of \(d\)-ary trees ⋮ The maximal number of induced \(r\)-partite subgraphs ⋮ Anticoncentration for subgraph statistics ⋮ Minimizing the number of 5-cycles in graphs with given edge-density ⋮ Unnamed Item ⋮ Inducibility of topological trees ⋮ The edge inducibility of graphs ⋮ Edge-statistics on large graphs ⋮ On the 3‐Local Profiles of Graphs ⋮ Inducibility of directed paths ⋮ The feasible region of induced graphs

This page was built for publication: The inducibility of graphs