Author:
Gerbner Dániel,Patkós Balázs
Abstract
AbstractFor graphs H, F and integer n, the generalized Turán 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.
Funder
Nemzeti Kutatási és Technológiai Hivatal
ELKH Alfréd Rényi Institute of Mathematics
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference30 articles.
1. Alon, N., Shikhelman, C.: Many $T$ copies in $H$-free graphs. J. Comb. Theory Ser. B 121, 146–172 (2016)
2. Alon, N., Rónyai, L., Szabó, T.: Norm-graphs: variations and applications. J. Comb. Theory Ser. B 76, 280–290 (1999)
3. Bayer, T., Mészáros, T., Rónyai, L., Szabó, T.: Exploring projective norm graphs (2019). arXiv preprint arXiv:1908.05190
4. Brown, W.G.: On graphs that do not contain a Thomsen graph. Can. Math. Bull. 9, 281–285 (1966)
5. Bukh, B.: Random algebraic construction of extremal graphs. Bull. Lond. Math. Soc. 47(6), 939–945 (2015)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献