On the public citation graph

Reconstructing combinatorial geometries

https://doi.org/10.1007/bfb0066444
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.1007/978-1-4612-2972-8_8openalex-snapshot
2-Isomorphic Graphs
inferredcites →https://doi.org/10.1007/bfb0060110openalex-snapshot
Reconstructing graphs
inferredcites →https://doi.org/10.1007/bfb0060114openalex-snapshot
Matroids versus graphs
inferredcites →https://doi.org/10.1090/s0002-9947-1972-0309764-6openalex-snapshot
A Decomposition for Combinatorial Geometries
inferredcites →https://doi.org/10.1142/9789814343831_0002openalex-snapshot
COMBINATORIAL GEOMETRIES
inferredcites →https://doi.org/10.2307/2371127openalex-snapshot
2-Isomorphic Graphs
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/jgt.3190010306openalex-snapshot
Graph reconstruction—a survey
inferred← citeshttps://doi.org/10.1002/sapm1979613211openalex-snapshot
Intersection Theory for Embeddings of Matroids into Uniform Geometries
inferred← citeshttps://doi.org/10.1007/978-3-642-11110-5_3openalex-snapshot
The Tutte Polynomial Part I: General Theory
inferred← citeshttps://doi.org/10.1007/bfb0066431openalex-snapshot
A survey of the reconstruction conjecture
inferred← citeshttps://doi.org/10.1007/bfb0066441openalex-snapshot
Chromatically equivalent graphs
inferred← citeshttps://doi.org/10.1007/s00373-006-0675-yopenalex-snapshot
Reconstructing under Group Actions
inferred← citeshttps://doi.org/10.1016/0095-8956(75)90074-xopenalex-snapshot
On the nonreconstructibility of combinatorial geometries
inferred← citeshttps://doi.org/10.1016/0095-8956(87)90062-1openalex-snapshot
A family of nonreconstructible hypergraphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)90031-5openalex-snapshot
A bibliography on chromatic polynomials
inferred← citeshttps://doi.org/10.1016/s0196-8858(02)00500-6openalex-snapshot
Unique representability and matroid reconstruction
inferred← citeshttps://doi.org/10.1137/s0895480101391648openalex-snapshot
Finite Subsets of the Plane are 18-Reconstructible
inferred← citeshttps://doi.org/10.1142/9789814335768_0006openalex-snapshot
Codes, Arrangements and Matroids
inferred← citeshttps://doi.org/10.37236/2863openalex-snapshot
Totally Symmetric Functions are Reconstructible from Identification Minors
inferred← citeshttps://doi.org/10.48550/arxiv.1208.3110openalex-snapshot
On the reconstructibility of totally symmetric functions and of other functions with a unique identification minor
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.