Imagen de Portada

Balanced spanning trees of the 2-by-N grid

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gallagher, Makenzie, Tapp, Kristopher
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics Physics and Society
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Metric geometry for ranking-based voting: Tools for learning electoral structure
por: Duchin, Moon, et al.
Publicado: (2026)

Parameter Effects in ReCom Ensembles
por: Tapp, Kristopher, et al.
Publicado: (2025)

On the Minimum Spanning Tree Distribution in Grids
por: Tapp, Kristopher
Publicado: (2024)

Revisiting Compactness for District Plans
por: Tapp, Kristopher
Publicado: (2025)

Bonsai: A class of effective methods for independent sampling of graph partitions
por: Clelland, Jeanne, et al.
Publicado: (2026)

Coplanarity of rooted spanning-tree vectors
por: Polettini, Matteo, et al.
Publicado: (2024)

Equivalent bounded confidence processes
por: Kurz, Sascha
Publicado: (2025)

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

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

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)

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)

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

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

The topology of simple games
por: Volic, Ismar, et al.
Publicado: (2025)

Compact majority-minority districts almost never exist
por: Alexeev, Boris, et al.
Publicado: (2024)

Key motifs searching in complex dynamical systems
por: Hu, Qitong, et al.
Publicado: (2024)

Random Maps with Sociological Flavor
por: Krapivsky, P. L.
Publicado: (2023)

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)

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

The average distance of spanning trees in terms of independence number
por: Du, Zhibin, et al.
Publicado: (2026)

Partial sampling of a random spanning tree
por: Jan, Yves Le
Publicado: (2025)

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

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

Almost spanning distance trees in subsets of finite vector spaces
por: Chakraborti, Debsoumya, et al.
Publicado: (2023)

Random Turán theorem for expansions of spanning subgraphs of tight trees
por: Nie, Jiaxi
Publicado: (2023)

A spanning tree model for chromatic homology
por: Banerjee, Aninda, et al.
Publicado: (2025)

The local limit of weighted spanning trees on balanced networks
por: Kúsz, Ágnes
Publicado: (2025)

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

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

Expanding the Katz Index for Link Prediction: A Case Study on a Live Fish Movement Network
por: Vidza, Michael-Sam, et al.
Publicado: (2024)

Modularity maximization and community detection in complex networks through recursive and hierarchical annealing in the D-Wave Advantage quantum processing units
por: Falcó-Roget, Joan, et al.
Publicado: (2024)

Discrete-time treatment number
por: Clarke, N. E., et al.
Publicado: (2024)