Results 111 to 120 of about 335 (183)

On algebraic matroids

open access: yesDiscrete Mathematics, 1993
The paper surveys recent results on algebraic matroids with the concentration on algebraic dependence over fields.
openaire   +2 more sources

Non-Preemptive Tree Packing. [PDF]

open access: yesAlgorithmica, 2023
Lendl S, Woeginger G, Wulf L.
europepmc   +1 more source

Codes, matroids and derived matroids

open access: yes, 2023
This thesis first introduces some theory on coding theory and matroids, and properties that are shared between these, and then we will investigate derived matroids. In 1979 Longyear made a construction of derived matroids for binary matroids, which illuminates "dependencies among dependencies".
openaire   +1 more source

Matroidal graphs

open access: yesDiscrete Mathematics, 1977
AbstractTwo edges of a graph are said to form a couple when their nodes can be labelled A, B, C, D so that A is adjacent to B but not to C, and D is adjacent to C but not to B. A graph is called matroidal if the binary relation “equals to or forms a couple with” among its edges is an equivalence relation. The structure of matroidal graphs is determined.
openaire   +2 more sources

Idealness of k-wise intersecting families. [PDF]

open access: yesMath Program, 2022
Abdi A, Cornuéjols G, Huynh T, Lee D.
europepmc   +1 more source

Projective hypersurfaces in tropical scheme theory I: the Macaulay ideal. [PDF]

open access: yesRes Math Sci
Fink A   +3 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy