Imagen de Portada

The bipartite analogue of a classical spanning tree enumeration formula, Boolean functions, and their applications to counting odd spanning trees

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Ge, Jun, Yu, Yamin
Formato:	Preprint
Publicado:	2026
Materias:	Combinatorics 05C30, 05C05
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
por: Wang, Wei, 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)

Effective resistance and spanning trees in complete graphs with distance-class deletions
por: Tamura, Shunya
Publicado: (2026)

A spectral condition for spanning trees with restricted degrees in bipartite graphs
por: Wu, Jiancheng, et al.
Publicado: (2024)

Odd spanning trees of a graph
por: Zheng, Jingyu, et al.
Publicado: (2025)

The strong vertex span of trees
por: Grašič, Mateja, et al.
Publicado: (2024)

A result on spanning trees with bounded total excess
por: Zhou, Sizhong
Publicado: (2025)

Eigenvalues and spanning trees with constrained degree
por: Liu, Chang, et al.
Publicado: (2023)

The absence of monochromatic triangle implies various properly colored spanning trees
por: Li, Ruonan, et al.
Publicado: (2024)

Spectral conditions for spanning $k$-trees or $k$-ended-trees of $t$-connected graphs
por: Lin, Jifu, et al.
Publicado: (2024)

Fibonacci and Lucas numbers arising from two-component spanning forests of wheel graphs
por: Miezaki, Tsuyoshi, et al.
Publicado: (2025)

A new strategy for finding spanning trees without small degree stems
por: Furuya, Michitaka, et al.
Publicado: (2023)

Refinements of degree conditions for the existence of a spanning tree without small degree stems
por: Furuya, Michitaka, et al.
Publicado: (2023)

Spectral radius and homeomorphically irreducible spanning trees of graphs
por: Gao, Bingqian, et al.
Publicado: (2025)

A neighborhood union condition for the existence of a spanning tree without degree $2$ vertices
por: Li, Yibo, et al.
Publicado: (2024)

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

On the minimal forts of trees
por: Cameron, Thomas R., et al.
Publicado: (2025)

On the number of spanning trees of bicirculant graphs
por: Yang, Jing, et al.
Publicado: (2026)

Weighted sums of rooted spanning forests on cycles with pendant edges
por: Fujita, Hajime, et al.
Publicado: (2024)

A note on plane trees with decreasing labels
por: Cheung, Tsun-Ming, et al.
Publicado: (2025)

Algorithmic releases on the spanning trees of suitable graphs
por: Imbesi, Maurizio, et al.
Publicado: (2017)

Embedding loose spanning trees in 3-uniform hypergraphs
por: Pehova, Yanitsa, et al.
Publicado: (2023)

Upper bound for the number of maximal dissociation sets in trees
por: Wang, Ziyuan, et al.
Publicado: (2024)

A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
por: Erde, Joshua, et al.
Publicado: (2019)

A neighborhood union condition for the existence of a spanning tree without samll degree vertices
por: Li, Yibo, et al.
Publicado: (2025)

Highly connected graphs have highly connected spanning bipartite subgraphs
por: Yuster, Raphael
Publicado: (2024)

Creating spanning trees in Waiter-Client games
por: Adamski, Grzegorz, et al.
Publicado: (2024)

Maximizing the index of signed complete graphs with spanning trees on $k$ pendant vertices
por: Li, Dan, et al.
Publicado: (2024)

On the enumeration of permutations avoiding chains of patterns
por: Zhou, Robin D. P., et al.
Publicado: (2024)

Symmetric and unimodal independence polynomials of trees
por: Hibi, Takayuki, et al.
Publicado: (2026)

Gallai-Ramsey multiplicity for rainbow small trees
por: Li, Xueliang, et al.
Publicado: (2023)

Exploring structural properties of $k$-trees and block graphs
por: Markenzon, Lilian, et al.
Publicado: (2023)

Principal minors of tree distance matrices
por: Richman, Harry, et al.
Publicado: (2024)

Models of random spanning trees
por: Babson, Eric, et al.
Publicado: (2024)

Asymptotic enumeration of graph factors by cumulant expansion
por: Isaev, Mikhail, et al.
Publicado: (2025)

Pseudo-orientable ribbon graphs: Matrix--Quasi-tree Theorem and log-concavity
por: Ding, Changxin, et al.
Publicado: (2026)

A method to optimize antipodal coloring span of graphs and its application
por: Kumar, Kush, et al.
Publicado: (2025)

Randomly perturbed digraphs also have bounded-degree spanning trees
por: Morawski, Patryk, et al.
Publicado: (2023)

Obstructions for normally spanned sets of vertices
por: Lorenz, Nicola, et al.
Publicado: (2025)

Minimal $L^p$-congestion spanning trees on weighted graphs
por: Lafuente, Alberto Castejón, et al.
Publicado: (2025)