The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Blocking and anti-blocking pairs of polyhedra
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Ford, D. R., & Fulkerson, D. R. (1962) · Cited by 4,072
Self-citationEdmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428
Maximum matching and a polyhedron with 0,1-vertices
Edmonds, J. (1965) · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · doi:10.6028/jres.069b.013 · Cited by 1,712
Edmonds, J. (2009) · Classic Papers in Combinatorics · doi:10.1007/978-0-8176-4842-8_26 · Cited by 1,517
A Decomposition Theorem for Partially Ordered Sets
Dilworth, R. P. (2009) · Classic Papers in Combinatorics · doi:10.1007/978-0-8176-4842-8_10 · Cited by 983
A Decomposition Theorem for Partially Ordered Sets
Dilworth, R. P. (1950) · The Annals of Mathematics · doi:10.2307/1969503 · Cited by 981
Ford, L. R., & Fulkerson, D. R. (1963) · Princeton University Press eBooks · doi:10.1515/9781400875184 · Cited by 891
Self-citationMatroids and the greedy algorithm
Edmonds, J. (1971) · Mathematical Programming · doi:10.1007/bf01584082 · Cited by 866
Edmonds, J. (1967) · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · doi:10.6028/jres.071b.032 · Cited by 731
Graph theory and theoretical physics
Harary, F. (1967) · Cited by 630
Submodular Functions, Matroids, and Certain Polyhedra
Edmonds, J. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36478-1_2 · Cited by 512
Minimum partition of a matroid into independent subsets
Edmonds, J. (1965) · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · doi:10.6028/jres.069b.004 · Cited by 444
Edmonds, J., & Fulkerson, D. R. (1970) · Journal of Combinatorial Theory · doi:10.1016/s0021-9800(70)80083-7 · Cited by 225
Self-citationFulkerson, D. R. (1972) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(72)90032-9 · Cited by 216
Self-citation
Metadata
- Authors
- Fulkerson, D. R.
- Venue
- Mathematical Programming
- Published
- 1971-12
- Volume
- 1
- Issue
- 1
- Pages
- 168-194
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2049716158
- Cited by
- 538
- References
- 14
- FWCI
- 6.51
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
