Cover Image

A closure result on spanning $k$-trees of graphs with given minimum degree

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Zhang, Wenqian
Format:	Preprint
Published:	2026
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Anticoncentration of random spanning trees in graphs with large minimum degree
by: Bitonti, Veronica, et al.
Published: (2026)

Size and spectral conditions for a graph with given minimum degree to be $k$-$d$-critical
by: Zhang, Zhenhao, et al.
Published: (2026)

The minimum size of a chordal graph with given order and minimum degree
by: Zhan, Xingzhi, et al.
Published: (2024)

Cycle lengths in graphs of given minimum degree
by: Bai, Yandong, et al.
Published: (2025)

The circumference of a graph with given minimum degree and clique number
by: Chen, Na, et al.
Published: (2025)

A strengthening on consecutive odd cycles in graphs of given minimum degree
by: Lin, Hao, et al.
Published: (2024)

The maximum size of a nonhamiltonian-connected graph with given order and minimum degree
by: Zhang, Leilei
Published: (2024)

Random minimum spanning tree and dense graph limits
by: Hladký, Jan, et al.
Published: (2023)

Bounded-degree spanning trees in randomly perturbed graphs
by: Krivelevich, Michael, et al.
Published: (2015)

The maximum number of cliques in graphs with given fractional matching number and minimum degree
by: Li, Chengli, et al.
Published: (2024)

On the oriented diameter of graphs with given minimum degree
by: Cochran, Garner, et al.
Published: (2024)

Sufficient conditions for spanning $k$-trees in tough graphs
by: Jia, Caili, et al.
Published: (2026)

Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs
by: Xu, Shaohan, et al.
Published: (2025)

On the minimum degree of minimal $k$-$\{1,2\}$-factor critical $k$-planar graphs
by: Pereyra, Kevin
Published: (2026)

On the random minimum edge-disjoint spanning trees problem
by: Shabanov, Dmitry, et al.
Published: (2025)

Sufficient conditions for fractional $k$-factor-critical graphs with minimum degree to be $k$-factor-critical
by: Zhong, Jiaxu, et al.
Published: (2026)

Spectral conditions for graphs to contain $k$-factors
by: Tang, Xinying, et al.
Published: (2025)

Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
by: Chakraborty, Dipayan, et al.
Published: (2024)

On the distance spectral radius, fractional matching and factors of graphs with given minimum degree
by: Xu, Zengzhao, et al.
Published: (2023)

The minimum edge-pancyclic graph of a given order
by: Zhao, Xiamiao, et al.
Published: (2025)

The existence of a spanning tree with leaf distance at least $d$ and leaf degree at most $k$ via the size or the spectral radius with respect to the minimum degree
by: Lin, Jifu, et al.
Published: (2024)

More results on the spectral radius of graphs with no odd wheels
by: Zhang, Wenqian
Published: (2024)

Large fringe trees for random trees with given vertex degrees
by: Ojeda, Gabriel Berzunza, et al.
Published: (2026)

A stability theorem for embedding bounded degree spanning trees
by: Csaba, Béla
Published: (2026)

The enumeration of odd spanning trees in graphs
by: Xu, Shaohan, et al.
Published: (2026)

On the size of universal graphs for spanning trees
by: Kim, Jaehoon, et al.
Published: (2025)

Discrepancies of spanning trees in dense graphs
by: Hollom, Lawrence, et al.
Published: (2024)

Some results on minimum saturated graphs
by: Zhang, Chenke, et al.
Published: (2025)

Spectral conditions for spanning $k$-trees or $k$-ended-trees of $t$-connected graphs
by: Lin, Jifu, et al.
Published: (2024)

On asymptotic values for the minimum number of spanning forests in simple regular graphs
by: Xu, Shaohan, et al.
Published: (2026)

A tight upper bound of spectral radius in terms of degree deviation
by: Zhang, Wenqian
Published: (2024)

On the maximum $σ$-irregularity of trees with given order and maximum degree
by: Bašić, Milan
Published: (2026)

Network fault costs based on minimum leaf spanning trees
by: Goedgebeur, Jan, et al.
Published: (2025)

Identifying codes in graphs of given maximum degree: Characterizing trees
by: Chakraborty, Dipayan, et al.
Published: (2024)

Semidegree threshold for spanning trees in oriented graphs
by: Araújo, Pedro, et al.
Published: (2026)

On the number of distinct spanning trees in pseudorandom graphs
by: Wang, Yiting
Published: (2026)

The Ferrers bound for spanning trees in bipartite graphs
by: Ho, Boon Suan
Published: (2026)

Embedding trees using minimum and maximum degree conditions
by: Pokrovskiy, Alexey, et al.
Published: (2025)

A spectral condition for spanning trees with restricted degrees in bipartite graphs
by: Wu, Jiancheng, et al.
Published: (2024)

Eigenvalues and spanning trees with constrained degree
by: Liu, Chang, et al.
Published: (2023)