Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Spencer Woolfson"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 24, no 2, Iss Graph Theory (2023)
In a generalized Tur\'an problem, two graphs $H$ and $F$ are given and the question is the maximum number of copies of $H$ in an $F$-free graph of order $n$. In this paper, we study the number of double stars $S_{k,l}$ in triangle-free graphs. We als
Externí odkaz:
https://doaj.org/article/5a8781071a274c8e9036907109cebbbd
In a generalized Tur\'an problem, two graphs $H$ and $F$ are given and the question is the maximum number of copies of $H$ in an $F$-free graph of order $n$. In this paper, we study the number of double stars $S_{k,l}$ in triangle-free graphs. We als
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c45b8afd25bbb0fca4e97f52b3d4ac84
http://arxiv.org/abs/2109.01536
http://arxiv.org/abs/2109.01536
