On the public citation graph

On the sum of matroids

https://doi.org/10.1007/bf01958043
0 signed · 21 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.2307/2284618openalex-snapshot
Combinatorial Mathematics and Its Applications.
inferredcites →https://doi.org/10.6028/jres.069b.001openalex-snapshot
Lectures on matroids

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cta.4490070105openalex-snapshot
Unique solvability and order of complexity of linear networks containing memoryless n ‐ports
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_18openalex-snapshot
Matroids—the Engineers’ Revenge
inferred← citeshttps://doi.org/10.1007/978-3-642-11110-5_6openalex-snapshot
Engineering Applications of Matroids - A Survey
inferred← citeshttps://doi.org/10.1007/bf02579437openalex-snapshot
Decomposition of binary matroids
inferred← citeshttps://doi.org/10.1007/bfb0071630openalex-snapshot
Some recent results on planarity and duality
inferred← citeshttps://doi.org/10.1007/bfb0120910openalex-snapshot
Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory
inferred← citeshttps://doi.org/10.1016/0012-365x(77)90115-7openalex-snapshot
Chords and disjoint paths in matroids
inferred← citeshttps://doi.org/10.1016/0095-8956(89)90010-5openalex-snapshot
The Tutte polynomial of a ported matroid
inferred← citeshttps://doi.org/10.1016/j.dam.2015.10.037openalex-snapshot
Matroid union — Graphic? Binary? Neither?
inferred← citeshttps://doi.org/10.1016/j.disc.2016.12.011openalex-snapshot
Partitioning the bases of the union of matroids
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.03.022openalex-snapshot
The graphicity of the union of graphic matroids
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00336-3openalex-snapshot
Two matroidal families on the edge set of a graph
inferred← citeshttps://doi.org/10.1016/s0012-365x(81)80023-4openalex-snapshot
On the sum of matroids, III
inferred← citeshttps://doi.org/10.1016/s0195-6698(88)80034-9openalex-snapshot
On Binary Reducibility
inferred← citeshttps://doi.org/10.1023/a:1012757316376openalex-snapshot
Matroids
inferred← citeshttps://doi.org/10.1080/10556788.2020.1740220openalex-snapshot
Applications of matroids in electric network theory
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb22468.xopenalex-snapshot
Some Open Problems in Matroid Theory
inferred← citeshttps://doi.org/10.1137/19m1304295openalex-snapshot
The Finite Matroid-Based Valuation Conjecture is False
inferred← citeshttps://doi.org/10.5772/35778openalex-snapshot
The Properties of Graphs of Matroids
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.