Generalized Turán problems for double stars

DOI10.1016/J.DISC.2023.113395MaRDI QIDQ6041852zbMATH OpenFDO

Authors Dániel Gerbner

Publication date 15 May 2023

Published in Discrete Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2112.11144

zbMATH Keywords

double stargeneralized Turán

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Abstract: We study the generalized Tur'an function $ex(n,H,F)$, when $H$ or $F$ is a double star $S_{a,b}$, which is a tree with a central edge $uv$, $a$ leaves connected to $u$ and $b$ leaves connected to $v$. We determine $ex(n,K_k,S_{a,b})$ and $ex(n,S_{a,b},F)$ for sufficiently large $n$, where $F$ is either a 3-chromatic graph with an edge whose deletion results in a bipartite graph, or the 2-fan, i.e. two triangles sharing a vertex. We also give bounds on $ex(n,S_{a,b},S_{c,d})$.

Recommendations

• Extremal problems of double stars
• Generalized Turán problems for disjoint copies of graphs
• Generalized Turán problems for \(K_{2,t}\)
• Generalized Turán problems for complete bipartite graphs
• Two results about the Turán number of star forests

Cites work

• scientific article; zbMATH DE number 3258858 (Why is no real title available?)
• scientific article; zbMATH DE number 3262986 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• scientific article; zbMATH DE number 3050594 (Why is no real title available?)
• Counting copies of a fixed subgraph in \(F\)-free graphs
• Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
• Extremal graphs for intersecting triangles
• Intersection theorems for systems of sets
• Many \(T\) copies in \(H\)-free graphs
• Maximizing the number of independent sets of a fixed size
• On Turán-good graphs
• On a problem of K. Zarankiewicz
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• Some exact results for generalized Turán problems
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent

Cited in

(6)

• The cycle of length four is strictly \(F\)-Turán-good
• Some exact results for non-degenerate generalized Turán problems
• Generalized Turán problems for \(K_{2,t}\)
• On extremal values of some degree-based topological indices with a forbidden or a prescribed subgraph
• Extremal problems of double stars
• On generalized Turán numbers of intersecting cliques

This page was built for publication: Generalized Turán problems for double stars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041852)