Cover Image

On the random minimum edge-disjoint spanning trees problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Shabanov, Dmitry, Zvonkov, Nikita
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Random Minimum Spanning Subgraph Problem for Hypergraphs
by: Zvonkov, Nikita
Published: (2024)

Eigenvalue conditions implying edge-disjoint spanning trees and a forest with constraints
by: Cai, Jin, et al.
Published: (2025)

Laplacian eigenvalue conditions for edge-disjoint spanning trees and a forest with constraints
by: Gao, Yongbin, et al.
Published: (2026)

Distance spectral radius conditions for edge-disjoint spanning trees and a forest with constraints
by: Gao, Yongbin, et al.
Published: (2026)

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

Spectral radius conditions for edge-disjoint spanning trees in $(k+c)$-edge-connected graphs
by: Gao, Yongbin, et al.
Published: (2026)

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

Edge disjoint Hamilton cycles in random digraphs of constant minimum degree
by: Cooper, Colin, et al.
Published: (2026)

Constructing edge-disjoint Steiner trees in Cartesian product networks
by: Li, Rui, et al.
Published: (2023)

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

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

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

Packing edge disjoint cliques in graphs
by: Balogh, József, et al.
Published: (2025)

How many times can two minimum spanning trees cross?
by: Antić, Todor, et al.
Published: (2026)

Partial sampling of a random spanning tree
by: Jan, Yves Le
Published: (2025)

On the number of spanning trees in random regular graphs
by: Greenhill, Catherine, et al.
Published: (2013)

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

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

Spectral radius and edge-disjoint connected factors of graphs
by: Tang, Xinying, et al.
Published: (2026)

Eigenvalues, edge-disjoint perfect matchings and toughness of regular graphs
by: Zhang, Wenqian
Published: (2024)

Highly connected orientations from edge-disjoint rigid subgraphs
by: Garamvölgyi, Dániel, et al.
Published: (2024)

Note on vertex disjoint rainbow triangles in edge-colored graphs
by: Kritschgau, Jürgen, et al.
Published: (2024)

Models of random spanning trees
by: Babson, Eric, et al.
Published: (2024)

Topology of a uniform spanning tree on a cylinder
by: Kalinin, Nikita, et al.
Published: (2026)

The diameter of random spanning trees interpolating between the UST and the MST of the complete graph
by: Kúsz, Ágnes
Published: (2024)

Minimum degree edge-disjoint Hamilton cycles in random directed graphs
by: Ferber, Asaf, et al.
Published: (2025)

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

Random choice spanning trees
by: Archer, Eleanor, et al.
Published: (2024)

The relation between different edge spans of a graph
by: Šubašić, Aljoša, et al.
Published: (2023)

Rainbow spanning structures in strongly edge-colored graphs
by: Ding, Laihao, 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)

Maximum spanning trees in normed planes
by: Alonso, Javier, et al.
Published: (2026)

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

Constructing disjoint Steiner trees in Sierpiński graphs
by: Yang, Chenxu, et al.
Published: (2023)

Signless Laplacian characterization of cones over disjoint unions of cycles, edges and isolated vertices
by: Ye, Jiachang, et al.
Published: (2025)

Fan's condition for completely independent spanning trees
by: Ma, Jie, et al.
Published: (2025)

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)

An exact-arithmetic algorithm for spanning tree modulus
by: Albin, Nathan, et al.
Published: (2020)