Extremal problems of double stars
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2021
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910327419961344 |
|---|---|
| author | Győri, Ervin Wang, Runze Woolfson, Spencer |
| author_facet | Győri, Ervin Wang, Runze Woolfson, Spencer |
| contents | In a generalized Turán 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 also study an opposite version of this question: what is the maximum number edges/triangles in graphs with double star type restrictions, which leads us to study two questions related to the extremal number of triangles or edges in graphs with degree-sum constraints over adjacent or non-adjacent vertices. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2109_01536 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Extremal problems of double stars Győri, Ervin Wang, Runze Woolfson, Spencer Combinatorics 05C35 In a generalized Turán 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 also study an opposite version of this question: what is the maximum number edges/triangles in graphs with double star type restrictions, which leads us to study two questions related to the extremal number of triangles or edges in graphs with degree-sum constraints over adjacent or non-adjacent vertices. |
| title | Extremal problems of double stars |
| topic | Combinatorics 05C35 |
| url | https://arxiv.org/abs/2109.01536 |