Autor:	Dániel Gerbner, Balázs Patkós
Rok vydání:	2022
Předmět:	Discrete Mathematics and Combinatorics Theoretical Computer Science
Zdroj:	Graphs and Combinatorics. 38
ISSN:	1435-5914 0911-0119
DOI:	10.1007/s00373-022-02570-3
Popis:	For 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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::9174318a8aacd62f4dbe092866a91a90 https://doi.org/10.1007/s00373-022-02570-3 Zobrazit plný text záznamu Full text from SpringerLink