Letzter, S;
(2019)
Many H-Copies in Graphs with a Forbidden Tree.
SIAM Journal on Discrete Mathematics
, 33
(4)
pp. 2360-2368.
10.1137/19m1239052.
Preview |
Text
Letzter_Many H-Copies in Graphs with a Forbidden Tree_VoR.pdf - Published Version Download (373kB) | Preview |
Abstract
For graphs H and F, let ex(n, H, F) be the maximum possible number of copies of H in an F-free graph on n vertices. The study of this function, which generalizes the well-studied Turan numbers of graphs, was initiated recently by Alon and Shikhelman. We show that if F is a tree, then ex(n, H, F) =\Theta (n^{r}) for an (explicit) integer r = r(H, F), thus answering one of their questions.
| Type: | Article |
|---|---|
| Title: | Many H-Copies in Graphs with a Forbidden Tree |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1137/19m1239052 |
| Publisher version: | https://doi.org/10.1137/19M1239052 |
| Language: | English |
| Additional information: | This version is the version of record. For information on re-use, please refer to the publisher's terms and conditions. |
| Keywords: | Turan, trees, extremal graph theory |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences > Dept of Mathematics |
| URI: | https://discovery-pp.ucl.ac.uk/id/eprint/10107275 |
Downloads since deposit
1,980Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months
Archive Staff Only
 |
View Item |
