Star-factors in graphs with large minimum degree

DOI10.1016/j.jctb.2018.04.006zbMath1397.05141OpenAlexW2801008708MaRDI QIDQ1791704

Rajko Nenadov

Publication date: 11 October 2018

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2018.04.006

zbMATH Keywords

spanning subgraphsgraph packing

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Related Items (1)

Spanning trees without adjacent vertices of degree 2

Cites Work

• Unnamed Item
• Exact algorithms for \(L(2,1)\)-labeling of graphs
• Almost \(H\)-factors in dense graphs
• Asymptotic lower bounds for Ramsey functions
• Tiling Turán theorems
• \(H\)-factors in dense graphs
• The minimum degree threshold for perfect graph packings
• High degree graphs contain large-star factors
• A constructive proof of the Lovász local lemma
• On the maximal number of independent circuits in a graph
• Proof of the Alon-Yuster conjecture

This page was built for publication: Star-factors in graphs with large minimum degree