Results 91 to 100 of about 275 (182)

On matroid connectivity

open access: yesJournal of Combinatorial Theory, Series B, 1981
AbstractThree types of matroid connectivity, including Tutte's, are defined and shown to generalize corresponding notions of graph connectivity. A theorem of Tutte on cyclically 3-connected graphs, is generalized to matroids.
openaire   +3 more sources

Tropical Carathéodory with Matroids. [PDF]

open access: yesDiscrete Comput Geom, 2023
Loho G, Sanyal R.
europepmc   +1 more source

Oriented matroids

open access: yesJournal of Combinatorial Theory, Series B, 1978
AbstractIn this paper, the basic properties of oriented matroids are examined. A topological representation theorem for oriented matroids is proven, utilizing the notion of an “arrangement of pseudo-hemispheres”. The duality theorem of linear programming is extended to oriented matroids.
Jon Folkman, Jim Lawrence
openaire   +1 more source

On the Bounding Function of Cogirth and Supereulerian Regular Matroids

open access: yesAxioms
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.
Xiaoxiao Qin, Fulong Ye, Bofeng Huo
doaj   +1 more source

Rough set approximations based on a matroidal structure over three sets. [PDF]

open access: yesAppl Intell (Dordr), 2023
Wang G, Mao H, Liu C, Zhang Z, Yang L.
europepmc   +1 more source

On products of matroids

open access: yesDiscrete Mathematics, 1981
AbstractWe show, by means of counterexamples, that products with rank rk(M)rk(N) of a matroid M by a matroid N do not exist in general, and that there is no free-est product of M by N. We prove that a canonical product of M by N (having rank rk(M)+rk(N)−1) is a free-est product in a certain (weaker) sense.
openaire   +1 more source

Geometric Lattice Structure of Covering and Its Application to Attribute Reduction through Matroids

open access: yesJournal of Applied Mathematics, 2014
The reduction of covering decision systems is an important problem in data mining, and covering-based rough sets serve as an efficient technique to process the problem.
Aiping Huang, William Zhu
doaj   +1 more source

Matroid psi classes. [PDF]

open access: yesSel Math New Ser, 2022
Dastidar J, Ross D.
europepmc   +1 more source

Tropical ideals do not realise all Bergman fans. [PDF]

open access: yesRes Math Sci, 2021
Draisma J, Rincón F.
europepmc   +1 more source

Home - About - Disclaimer - Privacy