Maximising the number of induced cycles in a graph

DOI10.1016/j.jctb.2017.03.007zbMath1368.05081arXiv1603.02960OpenAlexW2963666924MaRDI QIDQ2399349

Natasha Morrison, Alexander D. Scott

Publication date: 22 August 2017

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

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

zbMATH Keywords

holesinduced subgraphsinducibility

Mathematics Subject Classification ID

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

Related Items (3)

The maximum number of induced C5's in a planar graph ⋮ Maximising the number of cycles in graphs with forbidden subgraphs ⋮ On the inducibility of cycles

Cites Work

• Problems on cycles and colorings
• The inducibility of blow-up graphs
• A note on the inducibility of 4-vertex graphs
• Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
• Triangle-free graphs with the maximum number of cycles
• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximising the number of induced cycles in a graph