Saved in:
| Main Author: | Gao, Hui |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2511.18952 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Minimal spanning arborescence
by: Ray, Gourab, et al.
Published: (2024)
by: Ray, Gourab, et al.
Published: (2024)
On arborescence packing augmentation in hypergraphs
by: Hoppenot, Pierre, et al.
Published: (2024)
by: Hoppenot, Pierre, et al.
Published: (2024)
A Gray code for arborescences of tournaments
by: Bonamy, Marthe, et al.
Published: (2026)
by: Bonamy, Marthe, et al.
Published: (2026)
M-convexity of the minimum-cost packings of arborescences
by: Takazawa, Kenjiro
Published: (2018)
by: Takazawa, Kenjiro
Published: (2018)
Extremal number of arborescences
by: Bandekar, Aditya, et al.
Published: (2024)
by: Bandekar, Aditya, et al.
Published: (2024)
Packing large balanced trees into bipartite graphs
by: Fernandes, Cristina G., et al.
Published: (2024)
by: Fernandes, Cristina G., et al.
Published: (2024)
Matroid-reachability-based decomposition into arborescences
by: Hörsch, Florian, et al.
Published: (2024)
by: Hörsch, Florian, et al.
Published: (2024)
Anticoncentration of random spanning trees in graphs with large minimum degree
by: Bitonti, Veronica, et al.
Published: (2026)
by: Bitonti, Veronica, et al.
Published: (2026)
Packing Designs with large block size
by: Burgess, Andrea C., et al.
Published: (2024)
by: Burgess, Andrea C., et al.
Published: (2024)
A short note on spanning even trees
by: Ai, Jiangdong, et al.
Published: (2024)
by: Ai, Jiangdong, et al.
Published: (2024)
The extra basis in noncommuting variables
by: Aliniaeifard, Farid, et al.
Published: (2024)
by: Aliniaeifard, Farid, et al.
Published: (2024)
Sharp thresholds for spanning regular subgraphs
by: Zhukovskii, Maksim
Published: (2025)
by: Zhukovskii, Maksim
Published: (2025)
Degree conditions for spanning expansion hypertrees
by: Rao, Mengjiao, et al.
Published: (2025)
by: Rao, Mengjiao, et al.
Published: (2025)
On the size of universal graphs for spanning trees
by: Kim, Jaehoon, et al.
Published: (2025)
by: Kim, Jaehoon, et al.
Published: (2025)
Counting spanning subgraphs in dense hypergraphs
by: Montgomery, Richard, et al.
Published: (2023)
by: Montgomery, Richard, et al.
Published: (2023)
Discrepancies of spanning trees in dense graphs
by: Hollom, Lawrence, et al.
Published: (2024)
by: Hollom, Lawrence, et al.
Published: (2024)
Maximum spanning trees in normed planes
by: Alonso, Javier, et al.
Published: (2026)
by: Alonso, Javier, et al.
Published: (2026)
The enumeration of odd spanning trees in graphs
by: Xu, Shaohan, et al.
Published: (2026)
by: Xu, Shaohan, et al.
Published: (2026)
Random choice spanning trees
by: Archer, Eleanor, et al.
Published: (2024)
by: Archer, Eleanor, et al.
Published: (2024)
Packing arithmetic progressions
by: Alon, Noga, et al.
Published: (2026)
by: Alon, Noga, et al.
Published: (2026)
Measurable one-ended spanning trees
by: Bowen, Matt, et al.
Published: (2025)
by: Bowen, Matt, et al.
Published: (2025)
Laplacian eigenvalue conditions for edge-disjoint spanning trees and a forest with constraints
by: Gao, Yongbin, et al.
Published: (2026)
by: Gao, Yongbin, et al.
Published: (2026)
Minimum degree and sparse connected spanning subgraphs
by: Huang, Ting, et al.
Published: (2025)
by: Huang, Ting, et al.
Published: (2025)
Fan's condition for completely independent spanning trees
by: Ma, Jie, et al.
Published: (2025)
by: Ma, Jie, et al.
Published: (2025)
Semidegree threshold for spanning trees in oriented graphs
by: Araújo, Pedro, et al.
Published: (2026)
by: Araújo, Pedro, et al.
Published: (2026)
On the number of distinct spanning trees in pseudorandom graphs
by: Wang, Yiting
Published: (2026)
by: Wang, Yiting
Published: (2026)
An exact-arithmetic algorithm for spanning tree modulus
by: Albin, Nathan, et al.
Published: (2020)
by: Albin, Nathan, et al.
Published: (2020)
The Ferrers bound for spanning trees in bipartite graphs
by: Ho, Boon Suan
Published: (2026)
by: Ho, Boon Suan
Published: (2026)
Ramsey goodness of complete multipartite graphs with one large part
by: Mi, Shaonan, et al.
Published: (2026)
by: Mi, Shaonan, et al.
Published: (2026)
Rainbow copies of spanning subgraphs
by: Cooper, Colin, et al.
Published: (2025)
by: Cooper, Colin, et al.
Published: (2025)
Nearly spanning cycle in the percolated hypercube
by: Anastos, Michael, et al.
Published: (2025)
by: Anastos, Michael, et al.
Published: (2025)
List Packing and Correspondence Packing of Planar Graphs
by: Cranston, Daniel W., et al.
Published: (2024)
by: Cranston, Daniel W., et al.
Published: (2024)
Distance spectral radius conditions for edge-disjoint spanning trees and a forest with constraints
by: Gao, Yongbin, et al.
Published: (2026)
by: Gao, Yongbin, et al.
Published: (2026)
Packing subgraphs in regular graphs
by: Letzter, Shoham, et al.
Published: (2025)
by: Letzter, Shoham, et al.
Published: (2025)
On the Packing Coloring Gap of Graphs
by: Tarhini, Batoul, et al.
Published: (2026)
by: Tarhini, Batoul, et al.
Published: (2026)
On S-Packing Coloring of Subcubic Graphs
by: Bazzal, Hadeel Al
Published: (2024)
by: Bazzal, Hadeel Al
Published: (2024)
On the random minimum edge-disjoint spanning trees problem
by: Shabanov, Dmitry, et al.
Published: (2025)
by: Shabanov, Dmitry, et al.
Published: (2025)
Partitions of complete twisted graphs into plane spanning trees
by: Figueroa, Ana Paulina, et al.
Published: (2025)
by: Figueroa, Ana Paulina, et al.
Published: (2025)
The spanning tree spectrum: improved bounds and simple proofs
by: Alon, Noga, et al.
Published: (2025)
by: Alon, Noga, et al.
Published: (2025)
Spectral radius and homeomorphically irreducible spanning trees of graphs
by: Gao, Bingqian, et al.
Published: (2025)
by: Gao, Bingqian, et al.
Published: (2025)
Similar Items
-
Minimal spanning arborescence
by: Ray, Gourab, et al.
Published: (2024) -
On arborescence packing augmentation in hypergraphs
by: Hoppenot, Pierre, et al.
Published: (2024) -
A Gray code for arborescences of tournaments
by: Bonamy, Marthe, et al.
Published: (2026) -
M-convexity of the minimum-cost packings of arborescences
by: Takazawa, Kenjiro
Published: (2018) -
Extremal number of arborescences
by: Bandekar, Aditya, et al.
Published: (2024)