On the public citation graph
Matroids and Graphs
0 signed · 28 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1090/s0002-9947-1958-0101526-0openalex-snapshot
A Homotopy Theorem for Matroids, I
inferredcites →https://doi.org/10.1090/s0002-9947-58-99967-7openalex-snapshot
A Homotopy Theorem for Matroids, II
inferredcites →https://doi.org/10.2307/2371182openalex-snapshot
On the Abstract Properties of Linear Dependence
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-387-36062-x_12openalex-snapshot
On a Szegö type limit theorem and the asymptotic theory of random sums, integrals and quadratic forms
inferred← citeshttps://doi.org/10.1007/bf03010024openalex-snapshot
Les matrices de connexion et l'algèbre des réseaux
inferred← citeshttps://doi.org/10.1090/conm/843/16881openalex-snapshot
Discrete charms of Kähler geometry
inferred← citeshttps://doi.org/10.1090/memo/1439openalex-snapshot
Purity and Separation for Oriented Matroids
inferred← citeshttps://doi.org/10.1090/s0002-9904-1965-11272-1openalex-snapshot
A dual form of Kuratowski’s theorem
inferred← citeshttps://doi.org/10.1090/s0002-9939-1960-0117173-5openalex-snapshot
An Algorithm for Determining Whether a Given Binary Matroid is Graphic
inferred← citeshttps://doi.org/10.1090/s0002-9939-1965-0180568-2openalex-snapshot
Characterization of Totally Unimodular Matrices
inferred← citeshttps://doi.org/10.1090/s0002-9947-1986-0816330-2openalex-snapshot
Growth Rates and Critical Exponents of Classes of Binary Combinatorial Geometries
inferred← citeshttps://doi.org/10.1109/acssc.1985.671486openalex-snapshot
Topological Realizability of Single Contact Switching Funtions
inferred← citeshttps://doi.org/10.1109/lcomm.2015.2401572openalex-snapshot
A Random Local Matroid Search Algorithm to Construct Good Rate $1/p$ Systematic Binary Quasi-Cyclic Codes
inferred← citeshttps://doi.org/10.1109/tct.1962.1086917openalex-snapshot
The Realization of n-Port Networks Without Transformers - A Panel Discussion: Rebuttals
inferred← citeshttps://doi.org/10.1109/tct.1962.1086968openalex-snapshot
Note on the Realizability of Directed Graphs
inferred← citeshttps://doi.org/10.1109/tct.1965.1082485openalex-snapshot
Realization of Circuit Matrices
inferred← citeshttps://doi.org/10.1109/tct.1969.1082921openalex-snapshot
A Direct Procedure for the Synthesis of Network Graphs from a Given Fundamental Loop or Cutset Matrix
inferred← citeshttps://doi.org/10.1109/tct.1970.1083188openalex-snapshot
A proof of Tutte's realizability condition
inferred← citeshttps://doi.org/10.1109/tit.2008.924700openalex-snapshot
A Decomposition Theory for Binary Linear Codes
inferred← citeshttps://doi.org/10.4204/eptcs.352.8openalex-snapshot
Mechanization of Incidence Projective Geometry in Higher Dimensions, a Combinatorial Approach
inferred← citeshttps://doi.org/10.46298/dmtcs.12230openalex-snapshot
Minor-closed classes of binary functions
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.