Cover Image

On asymptotic values for the minimum number of spanning forests in simple regular graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Xu, Shaohan, Xu, Kexiang
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

The enumeration of odd spanning trees in graphs
by: Xu, Shaohan, 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 number of spanning trees in random regular graphs
by: Greenhill, Catherine, et al.
Published: (2013)

Color-avoiding connected spanning subgraphs with minimum number of edges
by: Pintér, József, et al.
Published: (2023)

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

The number of rooted spanning forests of bicirculant graphs
by: Yang, Jing, et al.
Published: (2025)

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

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

A closure result on spanning $k$-trees of graphs with given minimum degree
by: Zhang, Wenqian
Published: (2026)

Almost colour-balanced spanning forests in complete graphs
by: Hollom, Lawrence, et al.
Published: (2024)

Anticoncentration of random spanning trees in almost regular graphs
by: Lee, Hyunwoo
Published: (2026)

On expectations and variances in the hard-core model
by: Zhang, Weiyuan, et al.
Published: (2026)

Local limit of massive spanning forests on the complete graph
by: D'Achille, Matteo, et al.
Published: (2024)

On the number of minimum dominating sets and total dominating sets in forests
by: Petr, Jan, et al.
Published: (2022)

The minimum number of maximal dissociation sets in unicyclic graphs
by: Zhang, Junxia, et al.
Published: (2024)

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

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

The minimum number of maximal independent sets in graphs with given order and independence number
by: Tian, Yuting, et al.
Published: (2024)

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

On the minimum constant resistance curvature conjecture of graphs
by: Sun, Wensheng, et al.
Published: (2025)

On the isolation number of graphs with minimum degree four
by: Goddard, Wayne, et al.
Published: (2025)

On the minimum number of non-monochromatic simplices for Sperner labelings of a regular triangulation
by: Calvo, L. Á., et al.
Published: (2025)

On the number of spanning trees of bicirculant graphs
by: Yang, Jing, et al.
Published: (2026)

Uniquely $C_{4}^{+}$-saturated graphs
by: Li, Yuying, et al.
Published: (2024)

On the minimum number of arcs in $4$-dicritical oriented graphs
by: Havet, Frédéric, et al.
Published: (2023)

Sharp thresholds for spanning regular subgraphs
by: Zhukovskii, Maksim
Published: (2025)

The minimum number of distinct eigenvalues of a threshold graph is at most $4$
by: Allem, Luiz Emilio, et al.
Published: (2025)

Odd and even cycle lengths, minimum degree and chromatic number in graphs
by: Wang, Xiaolin
Published: (2025)

The Jacobian of a regular orthogonal matroid and torsor structures on spanning quasi-trees of ribbon graphs
by: Baker, Matthew, et al.
Published: (2025)

Fibonacci and Lucas numbers arising from two-component spanning forests of wheel graphs
by: Miezaki, Tsuyoshi, et al.
Published: (2025)

Comparing the $p$-independence number of regular graphs to the $q$-independence number of their line graphs
by: Caro, Yair, et al.
Published: (2024)

On enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
by: Wang, Wei, et al.
Published: (2026)

The spanning tree spectrum: improved bounds and simple proofs
by: Alon, Noga, et al.
Published: (2025)

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

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)

Universality of the matching number in percolated regular graphs
by: Diskin, Sahar, et al.
Published: (2025)

Edge density and minimum degree thresholds for $H$-free graphs with unbounded chromatic number
by: Wu, Zhuo, et al.
Published: (2025)

On the minimum number of distinct eigenvalues of triangle-free strongly regular graphs
by: Egolf, Emily, et al.
Published: (2025)

Partitioning triangle-free planar graphs into a forest and a linear forest
by: Liu, Guanwu, et al.
Published: (2025)