Imagen de Portada

Packing spanning arborescences with extra large one

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Gao, Hui
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Minimal spanning arborescence
por: Ray, Gourab, et al.
Publicado: (2024)

On arborescence packing augmentation in hypergraphs
por: Hoppenot, Pierre, et al.
Publicado: (2024)

A Gray code for arborescences of tournaments
por: Bonamy, Marthe, et al.
Publicado: (2026)

M-convexity of the minimum-cost packings of arborescences
por: Takazawa, Kenjiro
Publicado: (2018)

Extremal number of arborescences
por: Bandekar, Aditya, et al.
Publicado: (2024)

Packing large balanced trees into bipartite graphs
por: Fernandes, Cristina G., et al.
Publicado: (2024)

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

Packing Designs with large block size
por: Burgess, Andrea C., et al.
Publicado: (2024)

A short note on spanning even trees
por: Ai, Jiangdong, et al.
Publicado: (2024)

Matroid-reachability-based decomposition into arborescences
por: Hörsch, Florian, et al.
Publicado: (2024)

The extra basis in noncommuting variables
por: Aliniaeifard, Farid, et al.
Publicado: (2024)

Sharp thresholds for spanning regular subgraphs
por: Zhukovskii, Maksim
Publicado: (2025)

Degree conditions for spanning expansion hypertrees
por: Rao, Mengjiao, et al.
Publicado: (2025)

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

Counting spanning subgraphs in dense hypergraphs
por: Montgomery, Richard, et al.
Publicado: (2023)

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

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

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

Random choice spanning trees
por: Archer, Eleanor, et al.
Publicado: (2024)

Packing arithmetic progressions
por: Alon, Noga, et al.
Publicado: (2026)

Ramsey goodness of complete multipartite graphs with one large part
por: Mi, Shaonan, et al.
Publicado: (2026)

Minimum degree and sparse connected spanning subgraphs
por: Huang, Ting, et al.
Publicado: (2025)

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

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

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

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

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

Nearly spanning cycle in the percolated hypercube
por: Anastos, Michael, et al.
Publicado: (2025)

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

Packing subgraphs in regular graphs
por: Letzter, Shoham, et al.
Publicado: (2025)

On the Packing Coloring Gap of Graphs
por: Tarhini, Batoul, et al.
Publicado: (2026)

On S-Packing Coloring of Subcubic Graphs
por: Bazzal, Hadeel Al
Publicado: (2024)

Rainbow copies of spanning subgraphs
por: Cooper, Colin, et al.
Publicado: (2025)

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

Partitions of complete twisted graphs into plane spanning trees
por: Figueroa, Ana Paulina, et al.
Publicado: (2025)

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

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

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

Spectral Turán-type problems on sparse spanning graphs
por: Liu, Lele, et al.
Publicado: (2023)

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