- Article
Following Bauer’s 1985 question on how a graph’s minimum degree relates to it being supereulerian, Catlin solved the problem for graphs with a minimum degree of at least
Following Bauer’s 1985 question on how a graph’s minimum degree relates to it being supereulerian, Catlin solved the problem for graphs with a minimum degree of at least
Recently, we have introduced assigning polynomials of regular matroids that count nowhere-zero chains over finite Abelian groups associated with homomorphisms. The well-known broken circuit theorem of Whitney evaluates the coefficients of characteris...
A regular matroid M on a finite set E is represented by a totally unimodular matrix. The set of vectors from
We introduce a unifying approach for invariants of finite matroids that count mappings to a finite set. The aim of this paper is to show that if the cardinalities of mappings with fixed values on a restricted set satisfy contraction–deletion ru...
The Q-Learning Relational Game (QLRG) framework provides a theoretically rigorous method for identifying minimal winning coalitions in online social networks (OSNs) under the restrictive assumption of global agent symmetry or uniform matroid structur...