On the public citation graph

The Minimum Size of Matching-Saturated Graphs

0 signed · 7 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.1002/jgt.3190100209openalex-extracted

Saturated graphs with minimal number of edges

inferredcites →https://doi.org/10.1007/bf01428195openalex-extracted

1-Faktoren von Graphen

inferredcites →https://doi.org/10.1016/0012-365x(91)90327-xopenalex-extracted

Infinite matching theory

inferredcites →https://doi.org/10.1016/0095-8956(90)90098-kopenalex-extracted

LP duality in infinite hypergraphs

inferredcites →https://doi.org/10.1016/j.disc.2008.06.036openalex-extracted

tKp -saturated graphs of minimum size

inferredcites →https://doi.org/10.2307/2311408openalex-extracted

A Problem in Graph Theory

inferredcites →https://doi.org/10.37236/41openalex-extracted

A Survey of Minimum Saturated Graphs

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.