High degree graphs contain large-star factors
From MaRDI portal
Publication:3060855
zbMath1255.05145arXiv0810.2053MaRDI QIDQ3060855
Noga Alon, Nicholas C. Wormald
Publication date: 13 December 2010
Full work available at URL: https://arxiv.org/abs/0810.2053
Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (8)
Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs ⋮ Rainbow edge-coloring and rainbow domination ⋮ Fast exact algorithm for \(L(2,1)\)-labeling of graphs ⋮ Spanning trees with few non-leaves ⋮ Partial domination - the isolation number of a graph ⋮ On Constant Time Approximation of Parameters of Bounded Degree Graphs ⋮ Star-factors in graphs with large minimum degree ⋮ Spanning trees without adjacent vertices of degree 2
This page was built for publication: High degree graphs contain large-star factors
