The enumeration of odd spanning trees in graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | Xu, Shaohan, Xu, Kexiang |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
On asymptotic values for the minimum number of spanning forests in simple regular graphs
por: Xu, Shaohan, et al.
Publicado: (2026)
por: Xu, Shaohan, et al.
Publicado: (2026)
Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs
por: Xu, Shaohan, et al.
Publicado: (2025)
por: Xu, Shaohan, et al.
Publicado: (2025)
The bipartite analogue of a classical spanning tree enumeration formula, Boolean functions, and their applications to counting odd spanning trees
por: Ge, Jun, et al.
Publicado: (2026)
por: Ge, Jun, et al.
Publicado: (2026)
On enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
por: Wang, Wei, et al.
Publicado: (2026)
por: Wang, Wei, et al.
Publicado: (2026)
On the size of universal graphs for spanning trees
por: Kim, Jaehoon, et al.
Publicado: (2025)
por: Kim, Jaehoon, et al.
Publicado: (2025)
Discrepancies of spanning trees in dense graphs
por: Hollom, Lawrence, et al.
Publicado: (2024)
por: Hollom, Lawrence, et al.
Publicado: (2024)
Semidegree threshold for spanning trees in oriented graphs
por: Araújo, Pedro, et al.
Publicado: (2026)
por: Araújo, Pedro, et al.
Publicado: (2026)
On the number of distinct spanning trees in pseudorandom graphs
por: Wang, Yiting
Publicado: (2026)
por: Wang, Yiting
Publicado: (2026)
The Ferrers bound for spanning trees in bipartite graphs
por: Ho, Boon Suan
Publicado: (2026)
por: Ho, Boon Suan
Publicado: (2026)
On the number of spanning trees in random regular graphs
por: Greenhill, Catherine, et al.
Publicado: (2013)
por: Greenhill, Catherine, et al.
Publicado: (2013)
Sufficient conditions for spanning $k$-trees in tough graphs
por: Jia, Caili, et al.
Publicado: (2026)
por: Jia, Caili, et al.
Publicado: (2026)
Bounded-degree spanning trees in randomly perturbed graphs
por: Krivelevich, Michael, et al.
Publicado: (2015)
por: Krivelevich, Michael, et al.
Publicado: (2015)
Partitions of complete twisted graphs into plane spanning trees
por: Figueroa, Ana Paulina, et al.
Publicado: (2025)
por: Figueroa, Ana Paulina, et al.
Publicado: (2025)
On expectations and variances in the hard-core model
por: Zhang, Weiyuan, et al.
Publicado: (2026)
por: Zhang, Weiyuan, et al.
Publicado: (2026)
On the transmission irregular trees with the maximum Wiener index
por: Damnjanović, Ivan, et al.
Publicado: (2025)
por: Damnjanović, Ivan, et al.
Publicado: (2025)
Anticoncentration of random spanning trees in almost regular graphs
por: Lee, Hyunwoo
Publicado: (2026)
por: Lee, Hyunwoo
Publicado: (2026)
Random minimum spanning tree and dense graph limits
por: Hladký, Jan, et al.
Publicado: (2023)
por: Hladký, Jan, et al.
Publicado: (2023)
Coloring of graphs without long odd holes
por: Chen, Ran, et al.
Publicado: (2025)
por: Chen, Ran, et al.
Publicado: (2025)
Listing spanning trees of outerplanar graphs by pivot-exchanges
por: Behrooznia, Nastaran, et al.
Publicado: (2024)
por: Behrooznia, Nastaran, et al.
Publicado: (2024)
Two $t$-analogues of the tree inversion enumerator
por: Hopkins, Sam
Publicado: (2025)
por: Hopkins, Sam
Publicado: (2025)
Anticoncentration of random spanning trees in graphs with large minimum degree
por: Bitonti, Veronica, et al.
Publicado: (2026)
por: Bitonti, Veronica, et al.
Publicado: (2026)
Enumeration of spanning trees and resistance distances of generalized blow-up graphs
por: Liu, Hechao, et al.
Publicado: (2025)
por: Liu, Hechao, et al.
Publicado: (2025)
Odd spanning trees of a graph
por: Zheng, Jingyu, et al.
Publicado: (2025)
por: Zheng, Jingyu, et al.
Publicado: (2025)
Probabilistic enumeration and equivalence of nonisomorphic trees
por: Stufler, Benedikt
Publicado: (2023)
por: Stufler, Benedikt
Publicado: (2023)
Geometric bounds for spanning tree entropy of planar lattice graphs
por: Champanerkar, Abhijit, et al.
Publicado: (2025)
por: Champanerkar, Abhijit, et al.
Publicado: (2025)
A closure result on spanning $k$-trees of graphs with given minimum degree
por: Zhang, Wenqian
Publicado: (2026)
por: Zhang, Wenqian
Publicado: (2026)
On the number of spanning trees of bicirculant graphs
por: Yang, Jing, et al.
Publicado: (2026)
por: Yang, Jing, et al.
Publicado: (2026)
Weighted enumeration of nonbacktracking walks on weighted graphs
por: Arrigo, Francesca, et al.
Publicado: (2022)
por: Arrigo, Francesca, et al.
Publicado: (2022)
Asymptotic enumeration via graph containers and entropy
por: Park, Jinyoung
Publicado: (2025)
por: Park, Jinyoung
Publicado: (2025)
Uniquely $C_{4}^{+}$-saturated graphs
por: Li, Yuying, et al.
Publicado: (2024)
por: Li, Yuying, et al.
Publicado: (2024)
The diameter of random spanning trees interpolating between the UST and the MST of the complete graph
por: Kúsz, Ágnes
Publicado: (2024)
por: Kúsz, Ágnes
Publicado: (2024)
Random choice spanning trees
por: Archer, Eleanor, et al.
Publicado: (2024)
por: Archer, Eleanor, et al.
Publicado: (2024)
Maximum spanning trees in normed planes
por: Alonso, Javier, et al.
Publicado: (2026)
por: Alonso, Javier, et al.
Publicado: (2026)
Number of spanning trees in a wheel graph with two identified vertices via hitting times
por: Tamura, Shunya, et al.
Publicado: (2025)
por: Tamura, Shunya, et al.
Publicado: (2025)
The Jacobian of a regular orthogonal matroid and torsor structures on spanning quasi-trees of ribbon graphs
por: Baker, Matthew, et al.
Publicado: (2025)
por: Baker, Matthew, et al.
Publicado: (2025)
Spectral radius and homeomorphically irreducible spanning trees of graphs
por: Gao, Bingqian, et al.
Publicado: (2025)
por: Gao, Bingqian, et al.
Publicado: (2025)
On the complexity of finding a spanning even tree in a graph
por: Hanaka, Tesshu, et al.
Publicado: (2024)
por: Hanaka, Tesshu, et al.
Publicado: (2024)
On vertex-girth-regular graphs: (Non-)existence, bounds and enumeration
por: Jajcay, Robert, et al.
Publicado: (2024)
por: Jajcay, Robert, et al.
Publicado: (2024)
An exact-arithmetic algorithm for spanning tree modulus
por: Albin, Nathan, et al.
Publicado: (2020)
por: Albin, Nathan, et al.
Publicado: (2020)
A short note on spanning even trees
por: Ai, Jiangdong, et al.
Publicado: (2024)
por: Ai, Jiangdong, et al.
Publicado: (2024)
Ejemplares similares
-
On asymptotic values for the minimum number of spanning forests in simple regular graphs
por: Xu, Shaohan, et al.
Publicado: (2026) -
Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs
por: Xu, Shaohan, et al.
Publicado: (2025) -
The bipartite analogue of a classical spanning tree enumeration formula, Boolean functions, and their applications to counting odd spanning trees
por: Ge, Jun, et al.
Publicado: (2026) -
On enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
por: Wang, Wei, et al.
Publicado: (2026) -
On the size of universal graphs for spanning trees
por: Kim, Jaehoon, et al.
Publicado: (2025)