Cover Image

Effective MC-finiteness

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Filmus, Yuval, Fischer, Eldar, Makowsky, Johann A.
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 05, 05C30
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Meta-theorems for Graph Polynomials
by: Makowsky, Johann A.
Published: (2024)

Counting Finite Topologies
by: Fischer, Eldar, et al.
Published: (2023)

Distinctive power and comparability of Harary polynomial
by: Makowsky, Johann A.
Published: (2025)

Courcelle's Theorem Without Logic
by: Filmus, Yuval, et al.
Published: (2025)

Automated Counting of Spanning Trees for Several Infinite Families of Graphs
by: Blanco, Pablo, et al.
Published: (2025)

On the enumeration of connected sets in finite cylindrical lattice graphs
by: Ma, Hongxia, et al.
Published: (2025)

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

Terwilliger algebras and some related algebras defined by finite connected simple graphs
by: Hanaki, Akihide, et al.
Published: (2021)

The bipartite analogue of a classical spanning tree enumeration formula, Boolean functions, and their applications to counting odd spanning trees
by: Ge, Jun, et al.
Published: (2026)

Encoding and Enumerating Acyclic Orientations of Graphs
by: Carballosa, Walter, et al.
Published: (2023)

Enumerative Chromatic Choosability
by: Allred, Sarah, et al.
Published: (2025)

On Polynomial Representations of Dual DP Color Functions
by: Mudrock, Jeffrey A., et al.
Published: (2024)

Counting Packings of List-colorings of Graphs
by: Kaul, Hemanshu, et al.
Published: (2024)

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

Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs
by: Xu, Shaohan, et al.
Published: (2025)

Combinatorial Identities Using the Matrix Tree Theorem
by: Deepthi, Nayana Shibu, et al.
Published: (2025)

Mutual-Visibility of Tree and Its Line Graphs
by: B, Tonny K, et al.
Published: (2026)

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

Nordhaus-Gaddum inequalities for the number of 1-nearly independent vertex subsets
by: Andriantiana, Eric O. D., et al.
Published: (2026)

Enumeratively Chromatic-Choosable Theta Graphs
by: Chi, Yanghong, et al.
Published: (2026)

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

Difference ascent sequences and related combinatorial structures
by: Zang, Yongchun, et al.
Published: (2024)

On the DP-chromatic Number of Cartesian Products of Critical Graphs
by: Kaul, Hemanshu, et al.
Published: (2025)

On Polynomial Representations of the DP Color Function: Theta Graphs and Their Generalizations
by: Halberg, Charlie, et al.
Published: (2020)

Enumerating Cayley digraphs on dihedral groups
by: Lu, Zai Ping, et al.
Published: (2025)

Mutual visibility in Moore graphs and $(d,2)$-graphs with defect
by: B, Tonny K, et al.
Published: (2025)

Subgraphs in random graphs with specified degrees and forbidden edges
by: Larkin, John, et al.
Published: (2025)

The subpath number of cactus graphs
by: Knor, Martin, et al.
Published: (2025)

Invitation to the subpath number
by: Knor, Martin, et al.
Published: (2025)

Deranged Perfect Matchings on complete graph and balanced complete r-partite graph
by: Deng, Boqing
Published: (2025)

$2$-Restricted Optimal Pebbling Number of Some Graphs
by: Dehqan, Juma Gul, et al.
Published: (2025)

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

Counting geodesic paths in graphs
by: Knor, Martin, et al.
Published: (2026)

Arithmetical Structures on Coconut Trees
by: Diaz-Lopez, Alexander, et al.
Published: (2024)

On the number of connected edge cover sets in a graph
by: Zare, Mahsa, et al.
Published: (2024)

Closed-form expansions for the universal edge elimination polynomial
by: Dohmen, Klaus
Published: (2014)

Generalized Turán problem with bounded matching number
by: Ma, Yue, et al.
Published: (2023)

On enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
by: Wang, Wei, et al.
Published: (2026)

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

On extremal properties of perfect 2-colorings
by: Potapov, Vladimir N.
Published: (2022)