Skip to Content

5 Results Found

  • Article
  • Open Access
626 Views
15 Pages

9 April 2026

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 n5. Subsequently, Lai solved it for the case where the minimum degre...

  • Feature Paper
  • Article
  • Open Access
59 Views
7 Pages

12 November 2026

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...

(This article belongs to the Section E1: Mathematics and Computer Science)
  • Article
  • Open Access
2 Citations
1,220 Views
11 Pages

14 October 2024

A regular matroid M on a finite set E is represented by a totally unimodular matrix. The set of vectors from ZE orthogonal to rows of the matrix form a regular chain group N. Assume that ψ is a homomorphism from N into a finite additive Abelian g...

(This article belongs to the Section E1: Mathematics and Computer Science)
  • Article
  • Open Access
1 Citations
1,405 Views
10 Pages

3 June 2023

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...

(This article belongs to the Section E1: Mathematics and Computer Science)
  • Article
  • Open Access
2 Citations
907 Views
24 Pages

22 June 2026

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...