# [A Fully Polynomial Randomized Approximation Scheme for Perfect Matchings in General Graphs](main.pdf)

**Author:** OpenAI

**Date:** September 23, 2026

## Citation

```bibtex
@misc{OAI:A-Fully-Polynomial-Randomized-Approximation-Scheme-for-Perfect-Matchings-in-General-Graphs-September-23-2026,
  author = {{OpenAI}},
  title = {{A Fully Polynomial Randomized Approximation Scheme for Perfect Matchings in General Graphs}},
  howpublished = {OpenAI Math Release preprint
                  \href{https://github.com/openai/math/blob/main/preprints/A-Fully-Polynomial-Randomized-Approximation-Scheme-for-Perfect-Matchings-in-General-Graphs-September-23-2026/main.pdf}{OAI:A-Fully-Polynomial-Randomized-Approximation-Scheme-for-Perfect-Matchings-in-General-Graphs-September-23-2026}},
  year = {2026}
}
```