On the public citation graph

Matroids versus graphs

https://doi.org/10.1007/bfb0060114
0 signed · 59 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.1007/978-0-8176-4842-8_5openalex-snapshot
On the Abstract Properties of Linear Dependence1
inferredcites →https://doi.org/10.1007/978-1-4612-2972-8_8openalex-snapshot
2-Isomorphic Graphs
inferredcites →https://doi.org/10.1007/bf00531932openalex-snapshot
On the foundations of combinatorial theory I. Theory of M�bius Functions
inferredcites →https://doi.org/10.1016/s0021-9800(67)80034-6openalex-snapshot
Applications of the notion of independence to problems of combinatorial analysis
inferredcites →https://doi.org/10.1016/s0021-9800(69)80033-5openalex-snapshot
Euler and bipartite matroids
inferredcites →https://doi.org/10.1017/s0305004100044017openalex-snapshot
On the hyperplanes of a matroid
inferredcites →https://doi.org/10.1073/pnas.39.4.315openalex-snapshot
On the Number of Husimi Trees
inferredcites →https://doi.org/10.1080/00029890.1956.11988836openalex-snapshot
Systems of Distinct Representatives and Linear Programming
inferredcites →https://doi.org/10.1093/qmath/os-13.1.83openalex-snapshot
A THEOREM ON INDEPENDENCE RELATIONS
inferredcites →https://doi.org/10.1112/jlms/s1-10.37.26openalex-snapshot
On Representatives of Subsets
inferredcites →https://doi.org/10.1112/jlms/s1-36.1.221openalex-snapshot
On the Problem of Decomposing a Graph into n Connected Factors
inferredcites →https://doi.org/10.1112/jlms/s1-36.1.445openalex-snapshot
Edge-Disjoint Spanning Trees of Finite Graphs
inferredcites →https://doi.org/10.1112/plms/s3-7.1.300openalex-snapshot
Note on Independence Functions
inferredcites →https://doi.org/10.1112/s0025579300002576openalex-snapshot
Some applications of a theorem of Rado
inferredcites →https://doi.org/10.1137/0112059openalex-snapshot
A Solution of the Shannon Switching Game
inferredcites →https://doi.org/10.1515/9781400881987-011openalex-snapshot
10. On Systems of Distinct Representatives
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY
inferredcites →https://doi.org/10.2307/2309032openalex-snapshot
Systems of Distinct Representations and Linear Programming
inferredcites →https://doi.org/10.2307/2371127openalex-snapshot
2-Isomorphic Graphs
inferredcites →https://doi.org/10.2307/2371182openalex-snapshot
On the Abstract Properties of Linear Dependence
inferredcites →https://doi.org/10.4064/cm-14-1-257-264openalex-snapshot
Abstract linear dependence
inferredcites →https://doi.org/10.4064/fm-28-1-22-32openalex-snapshot
A combinatorial condition for planar graphs
inferredcites →https://doi.org/10.5948/upo9781614440147.007openalex-snapshot
Systems of distinct representatives
inferredcites →https://doi.org/10.6028/jres.069b.001openalex-snapshot
Lectures on matroids
inferredcites →https://doi.org/10.6028/jres.069b.004openalex-snapshot
Minimum partition of a matroid into independent subsets
inferredcites →https://doi.org/10.6028/jres.069b.005openalex-snapshot
Lehmans switching game and a theorem of Tutte and Nash-Williams

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118033104.ch10openalex-snapshot
Matroids
inferred← citeshttps://doi.org/10.1002/jgt.3190040103openalex-snapshot
Concept of a vertex in a matroid and 3‐connected graphs
inferred← citeshttps://doi.org/10.1007/978-1-4684-9199-9_2openalex-snapshot
Linear representation of matroids
inferred← citeshttps://doi.org/10.1007/978-3-031-76738-8_18openalex-snapshot
Dominic Welsh: His Work and Influence
inferred← citeshttps://doi.org/10.1007/978-3-319-45587-7_9openalex-snapshot
Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games
inferred← citeshttps://doi.org/10.1007/978-3-642-11110-5_4openalex-snapshot
On 3-Connected Matroids and Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_8openalex-snapshot
Applications of Matroid Theory
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_18openalex-snapshot
Competitive Algorithms for Restricted Caching and Matroid Caching
inferred← citeshttps://doi.org/10.1007/bf01111390openalex-snapshot
On subgraphs as matroid cells
inferred← citeshttps://doi.org/10.1007/bf01580137openalex-snapshot
A greedy algorithm for solving a certain class of linear programmes
inferred← citeshttps://doi.org/10.1007/bfb0061078openalex-snapshot
Matroids and block designs
inferred← citeshttps://doi.org/10.1007/bfb0066195openalex-snapshot
Aspects of the theory of hypermatroids
inferred← citeshttps://doi.org/10.1007/bfb0066444openalex-snapshot
Reconstructing combinatorial geometries
inferred← citeshttps://doi.org/10.1016/0012-365x(72)90081-7openalex-snapshot
On the automorphism group of a matroid
inferred← citeshttps://doi.org/10.1016/0020-0190(75)90021-6openalex-snapshot
Bounds for 3-matroid intersection problems
inferred← citeshttps://doi.org/10.1016/0022-247x(72)90030-3openalex-snapshot
A characterisation of binary transversal structures
inferred← citeshttps://doi.org/10.1016/0022-247x(73)90124-8openalex-snapshot
A property of the hyperplanes of a matroid and an extension of Dilworth's theorem
inferred← citeshttps://doi.org/10.1016/0022-247x(76)90220-1openalex-snapshot
Notes on circuit spaces
inferred← citeshttps://doi.org/10.1016/0095-8956(77)90026-0openalex-snapshot
A product of matroids and its automorphism group
inferred← citeshttps://doi.org/10.1016/0095-8956(79)90055-8openalex-snapshot
Matroid representation over GF(3)
inferred← citeshttps://doi.org/10.1016/j.aam.2016.01.006openalex-snapshot
The binary matroids whose only odd circuits are triangles
inferred← citeshttps://doi.org/10.1016/s0076-5392(08)63140-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1017/s1446788700023922openalex-snapshot
A note on matroids and block designs
inferred← citeshttps://doi.org/10.1080/00029890.1973.11993318openalex-snapshot
An Introduction to Matroid Theory
inferred← citeshttps://doi.org/10.1090/s0002-9939-1971-0289335-5openalex-snapshot
Induced Matroids
inferred← citeshttps://doi.org/10.1090/s0002-9939-1974-0387087-4openalex-snapshot
On Fundamental Transversal Matroids
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00009openalex-snapshot
SaPHyRa: A Learning Theory Approach to Ranking Nodes in Large Networks
inferred← citeshttps://doi.org/10.1112/s0025579300005465openalex-snapshot
Properties of finite character of independence spaces
inferred← citeshttps://doi.org/10.1137/0122021openalex-snapshot
On the Tree Graph of a Matroid
inferred← citeshttps://doi.org/10.1137/0125060openalex-snapshot
A Graphical Representation of Matroids
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.4185openalex-snapshot
The Graphs and Matroids Whose Only Odd Circuits Are Small
inferred← citeshttps://doi.org/10.32469/10355/37801openalex-snapshot
Fusion frame constructions and frame partitions
inferred← citeshttps://doi.org/10.4018/978-1-4666-4991-0.ch012openalex-snapshot
An Algebraic Study of the Notion of Independence of Frames
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.