The maximum number of stars in a graph without linear forest

DOI10.1007/s00373-022-02580-1zbMath1502.05096arXiv2112.13202OpenAlexW4306318596MaRDI QIDQ2093100

Sumin Huang, Jian Guo Qian

Publication date: 4 November 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

starTurán numberlinear forestgeneralized Turán number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• On the Turán number of forests
• Pentagons vs. triangles
• The Turán number for spanning linear forests
• Generalized Turán number of even linear forests
• The formula for Turán number of spanning linear forests
• The shifting method and generalized Turán number of matchings
• The Turán number of disjoint copies of paths
• On maximal paths and circuits of graphs
• The maximum number of $P_\ell$ copies in $P_k$-free graphs
• Many \(T\) copies in \(H\)-free graphs

This page was built for publication: The maximum number of stars in a graph without linear forest