论文信息 - A bound on the inducibility of cycles

A bound on the inducibility of cycles

Abstract In 1975, Pippenger and Golumbic conjectured that every n -vertex graph has at most n k / ( k k − k ) induced cycles of length k ≥ 5 . We prove that every n -vertex graph has at most 2 n k / k k induced cycles of length k .

Jan Volec | Daniel Král | Sergey Norin

[1] Hamed Hatami,et al. The inducibility of blow-up graphs , 2014, J. Comb. Theory, Ser. B.

[2] Béla Bollobás,et al. The maximal number of inducedr-partite subgraphs , 1995, Graphs Comb..

[3] James Hirst. The Inducibility of Graphs on Four Vertices , 2014, J. Graph Theory.

[4] Martin Charles Golumbic,et al. The inducibility of graphs , 1975 .

[5] Jason I. Brown,et al. The inducibility of complete bipartite graphs , 1994 .

[6] József Balogh,et al. Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle , 2016, Eur. J. Comb..

[7] Dan Hefetz,et al. On the inducibility of cycles , 2018, J. Comb. Theory, Ser. B.

[8] Béla Bollobás,et al. The maximal number of induced complete bipartite graphs , 1986, Discret. Math..