Generalized Turan Problems for Complete Bipartite Graphs

被引：3

作者：

Gerbner, Daniel ^{[1
]}

Patkos, Balazs ^{[1
]}

机构：

[1] Alfred Renyi Inst Math, Budapest, Hungary

来源：

GRAPHS AND COMBINATORICS | 2022年 / 38卷 / 05期

关键词：

Extremal graph theory; Generalized Turan problems; Complete bipartite graphs; Stability results; NORM-GRAPHS; COPIES;

D O I：

10.1007/s00373-022-02570-3

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

For graphs H, F and integer n, the generalized Turan number ex(n, H, F) denotes the maximum number of copies of H that an F-free n-vertex graph can have. We study this parameter when both H and F are complete bipartite graphs.

引用

页数：20

共 30 条

[1] Norm-graphs:: Variations and applications
Alon, N
Rónyai, L
Szabó, T
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1999, 76 (02) : 280 - 290
[2] Many T copies in H-free graphs
Alon, Noga
Shikhelman, Clara
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2016, 121 : 146 - 172
[3] Bayer T., 2019, ARXIV
[4] ON GRAPHS THAT DO NOT CONTAIN A THOMSEN GRAPH
BROWN, WG
[J]. CANADIAN MATHEMATICAL BULLETIN, 1966, 9 (03): : 281 - &
[5] Random algebraic construction of extremal graphs
Bukh, Boris
[J]. BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 2015, 47 : 939 - 945
[6] New asymptotics for bipartite Turan numbers
Furedi, Z
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 1996, 75 (01) : 141 - 144
[7] Furedi Z, 2020, Arxiv, DOI arXiv:2002.07350
[8] Furedi Zoltan, 1996, Combinatorics, Probability and Computing, V5, P29, DOI 10.1017/S09635483000
[9] Gerbner D., 2020, ARXIV
[10] Gerbner D, 2020, Arxiv, DOI arXiv:2006.16150

← 1 2 3 →