论文信息 - Graphs with Many Copies of a Given Subgraph - 字舞流文

Graphs with Many Copies of a Given Subgraph

We show that if a graph G of order n contains many copies of a given subgraph H, then it contains a blow-up of H of order log n.

Vladimir Nikiforov

[1] Béla Bollobás,et al. Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[2] V. Nikiforov. Graphs with many r‐cliques have large complete r‐partite subgraphs , 2007, math/0703554.

[3] L. Lovász. Combinatorial problems and exercises , 1979 .

[4] Vladimir Nikiforov. Complete r-partite subgraphs of dense r-graphs , 2009, Discret. Math..