Results 81 to 90 of about 4,266 (227)
Proceedings of the American Mathematical Society, 1971 There are several known results concerning how matroids can be induced from given matroids by a bipartite graph and the properties that are inherited in this way. The purpose of this note is to extend some of these results to the situation where the bipartite graph is replaced by an arbitrary directed graph.
openaire +1 more source
Multidimensional Topological Measure Spaces and Their Applications in Decision‐Making Problems
Advances in Fuzzy Systems, Volume 2026, Issue 1, 2026.This paper presents a generalized framework termed the multidimensional topological measure space (MDTMS), developed through multidimensional fuzzy sets, multidimensional topology, and an associated distance measure. The suggested framework enhances traditional fuzzy models by facilitating a more nuanced representation and examination of intricate ...
Jomal Josen +3 more
wiley +1 more source
Discrete Mathematics, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
James G. Oxley, Haidong Wu
openaire +1 more source
On Some Algorithmic and Structural Results on Flames
Journal of Graph Theory, Volume 110, Issue 4, Page 392-397, December 2025.ABSTRACT A directed graph F with a root node r is called a flame if for every vertex v other than r the local edge‐connectivity value λ F ( r , v ) from r to v is equal to ϱ F ( v ), the in‐degree of v. It is a classic, simple and beautiful result of Lovász [4] that every digraph D with a root node r has a spanning subgraph F that is a flame and the λ (
Dávid Szeszlér
wiley +1 more source
Geometric Lattice Structure of Covering-Based Rough Sets through Matroids
Journal of Applied Mathematics, 2012 Covering-based rough set theory is a useful tool to deal with inexact, uncertain, or vague knowledge in information systems. Geometric lattice has been widely used in diverse fields, especially search algorithm design, which plays an important role in ...
Aiping Huang, William Zhu
doaj +1 more source
Girth in GF(q)$\textsf {GF}(q)$‐representable matroids
Bulletin of the London Mathematical Society, Volume 57, Issue 11, Page 3401-3407, November 2025.Abstract We prove a conjecture of Geelen, Gerards, and Whittle that for any finite field GF(q)$\textsf {GF}(q)$ and any integer t$t$, every cosimple GF(q)$\textsf {GF}(q)$‐representable matroid with sufficiently large girth contains either M(Kt)$M(K_t)$ or M(Kt)∗$M(K_t)^*$ as a minor.
James Davies +4 more
wiley +1 more source
Discrete Mathematics, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Will Agnew-Svoboda +5 more
openaire +3 more sources
Towards a splitter theorem for internally 4-connected binary matroids
, 2011 This is the post-print version of the Article - Copyright @ 2012 ElsevierWe prove that if M is a 4-connected binary matroid and N is an internally 4-connected proper minor of M with at least 7 elements, then, unless M is a certain 16-element matroid ...
Chun, Carolyn +8 more
core +1 more source
Covering-Based Rough Sets on Eulerian Matroids
Journal of Applied Mathematics, 2013 Rough set theory is an efficient and essential tool for dealing with vagueness and granularity in information systems. Covering-based rough set theory is proposed as a significant generalization of classical rough sets.
Bin Yang, Ziqiong Lin, William Zhu
doaj +1 more source
Renormalization group-like proof of the universality of the Tutte polynomial for matroids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 In this paper we give a new proof of the universality of the Tutte polynomial for matroids. This proof uses appropriate characters of Hopf algebra of matroids, algebra introduced by Schmitt (1994). We show that these Hopf algebra characters are solutions
G. Duchamp +3 more
doaj +1 more source