Ervin Győri ; Runze Wang ; Spencer Woolfson - Extremal problems of double stars

dmtcs:8499 - Discrete Mathematics & Theoretical Computer Science, April 20, 2023, vol. 24, no 2 - https://doi.org/10.46298/dmtcs.8499
Extremal problems of double starsArticle

Authors: Ervin Győri ; Runze Wang ; Spencer Woolfson

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.

Comment: 18 pages, 4 figures

https://doi.org/10.46298/dmtcs.8499
Source: arXiv.org:2109.01536
Volume: vol. 24, no 2
Section: Graph Theory
Published on: April 20, 2023
Accepted on: September 1, 2022
Submitted on: September 18, 2021
Keywords: Mathematics - Combinatorics, 05C35
Licence: arXiv.org - Non-exclusive license to distribute

Classifications

Mathematics Subject Classification 20201
Sources:
  • [1] zbMATH Open.

Publications

Has review
  • 1 zbMATH Open

Share and export

Consultation statistics

This page has been seen 769 times.
This article's PDF has been downloaded 880 times.