Degree powers and number of stars in graphs with a forbidden broom

DOI10.1016/J.DISC.2024.114232MaRDI QIDQ6635099

Dániel Gerbner

Publication date: 9 November 2024

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

zbMATH Keywords

broom graphdegree powersgeneralized Turán problems

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Vertex degrees (05C07)

Cites Work

• Title not available (Why is that?)
• Hypergraph extensions of the Erdős-Gallai theorem
• A Turán type problem concerning the powers of the degrees of a graph
• An Erdős-Gallai type theorem for uniform hypergraphs
• Degree powers in graphs with a forbidden forest
• Degree powers of graphs without \(B_{\ell,s}\)
• Tur\'an's Problem for Trees
• Kalai's conjecture in \(r\)-partite \(r\)-graphs

This page was built for publication: Degree powers and number of stars in graphs with a forbidden broom

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