Degree powers in graphs with a forbidden forest

DOI10.1016/J.DISC.2018.11.013zbMath1403.05031arXiv1801.02023OpenAlexW2963013951MaRDI QIDQ1712530

Peng Zhang

Publication date: 22 January 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

forestTurán-type problem\(H\)-freedegree power

Mathematics Subject Classification ID

Vertex degrees (05C07)

Related Items (10)

The Turán number for \(4 \cdot S_{\ell}^1\) ⋮ The maximum outdegree power of complete \(k\)-partite oriented graphs ⋮ On the spectral radius of graphs without a star forest ⋮ Degree powers of graphs without \(B_{\ell,s}\) ⋮ Rainbow numbers for paths in planar graphs ⋮ Nordhaus-Gaddum type results for graph irregularities ⋮ Upper bound on the sum of powers of the degrees of graphs with few crossings per edge ⋮ Rainbow numbers for small graphs in planar graphs ⋮ Two results about the Turán number of star forests ⋮ Degree powers in \(K_{s,t}\)-minor free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Turán number of forests
• Turán numbers for disjoint copies of graphs
• Degree powers in \(C_5\)-free graphs
• A Turán type problem concerning the powers of the degrees of a graph
• Path Ramsey numbers in multicolorings
• Degree powers in graphs with forbidden subgraphs
• The Turán number of disjoint copies of paths
• Degree powers in graphs with a forbidden even cycle
• Degree Powers in Graphs: The Erdős–Stone Theorem
• Tur\'an's Problem for Trees
• Turán Numbers of Multiple Paths and Equibipartite Forests
• On maximal paths and circuits of graphs
• On the structure of linear graphs

This page was built for publication: Degree powers in graphs with a forbidden forest