Gerbner, Dániel (2023) Paths are Turan-good. GRAPHS AND COMBINATORICS, 39 (3). ISSN 0911-0119
|
Text
s00373-023-02641-z.pdf - Published Version Download (158kB) | Preview |
Official URL: https://doi.org/10.1007/s00373-023-02641-z
Abstract
We show that among Kk+1-free n-vertex graphs, the Turan graph contains the most copies of any path.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | PATH; Generalized Turán; Turan graph; Turán-good; |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 05 Apr 2024 10:45 |
| Last Modified: | 05 Apr 2024 10:45 |
| URI: | https://real.mtak.hu/id/eprint/191884 |
Actions (login required)
 |
Edit Item |
