A bound on the inducibility of cycles

DOI10.1016/j.jcta.2018.08.003zbMath1400.05074arXiv1801.01556OpenAlexW2781906402WikidataQ57601310 ScholiaQ57601310MaRDI QIDQ1621427

Daniel Král', Jan Volec, Serguei Norine

Publication date: 8 November 2018

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

Full work available at URL: https://arxiv.org/abs/1801.01556

zbMATH Keywords

cyclesextremal graph theoryinducibility

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items

Inducibility and universality for trees ⋮ On the inducibility of oriented graphs on four vertices ⋮ 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 ⋮ Stability from graph symmetrisation arguments with applications to inducibility ⋮ Planar graphs with the maximum number of induced 6-cycles ⋮ The edge-statistics conjecture for \(\ell \ll k^{6/5} \) ⋮ Anticoncentration for subgraph statistics ⋮ Edge-statistics on large graphs ⋮ Inducibility of directed paths

Cites Work

• The inducibility of blow-up graphs
• Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
• The maximal number of induced complete bipartite graphs
• The inducibility of graphs
• The maximal number of induced \(r\)-partite subgraphs
• The inducibility of complete bipartite graphs
• The Inducibility of Graphs on Four Vertices
• Flag algebras
• On the inducibility of cycles