On the inducibility of cycles

DOI10.1016/j.endm.2017.07.012zbMath1379.05061arXiv1702.07342OpenAlexW2596412577MaRDI QIDQ5915820

Mykhaylo Tyomkyn, Dan Hefetz

Publication date: 18 January 2018

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

cyclesextremal problemsinducibilitymultivariate optimisation

Mathematics Subject Classification ID

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

Related Items (5)

A bound on the inducibility of cycles ⋮ On the exact maximum induced density of almost all graphs and their inducibility ⋮ Strong forms of stability from flag algebra calculations ⋮ On the inducibility of cycles ⋮ On the inducibility of cycles

Cites Work

• Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
• The inducibility of graphs
• On the inducibility of cycles

This page was built for publication: On the inducibility of cycles