Results 111 to 120 of about 4,266 (227)

Hypergraphic matroids [PDF]

, 1978
A method of defining a matroid on the edge-set of a k-uniform hypergraph (a k-hypergraph) is defined, which is a generalisation of that used for defining a matroid on the edge-set of a graph; the matroids so defined are called "hypergraphic matroids".
Main, Roger Anthony
core   +1 more source

Liftable Point-Line Configurations: Defining Equations and Irreducibility of Associated Matroid and Circuit Varieties

Mathematics
We study point-line configurations through the lens of projective geometry and matroid theory. Our focus is on their realization spaces, where we introduce the concepts of liftable and quasi-liftable configurations, exploring cases in which an n-tuple of
Oliver Clarke, Giacomo Masiero, Fatemeh Mohammadi   +2 more
doaj   +1 more source

Semi-streaming algorithms for submodular matroid intersection. [PDF]

Math Program, 2023
Garg P, Jordan L, Svensson O.
europepmc   +1 more source

Matroid inequalities

Discrete Mathematics, 1995
This communication is an announcement of results for \(h\)-vectors of matroids which settle a conjecture of Stanley.
openaire   +1 more source

Approximation operators via TD-matroids on two sets. [PDF]

Soft comput, 2022
Wang G, Mao H.
europepmc   +1 more source

Tropical Carathéodory with Matroids. [PDF]

Discrete Comput Geom, 2023
Loho G, Sanyal R.
europepmc   +1 more source

On products of matroids

Discrete 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

On the Bounding Function of Cogirth and Supereulerian Regular Matroids

Axioms
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]

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

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

Journal 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