Factorially many maximum matchings close to the Erd\H{o}s-Gallai bound | NobleID

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

Factorially many maximum matchings close to the Erd\H{o}s-Gallai bound

Identifier:nobleid.org/w1/20260515/C40C3CD4

Type:Preprint

0 views

Support unavailableClaim Your Authorship

View Original Paper Source

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/C40C3CD4.svg?ark=w1%2F20260515%2FC40C3CD4)](https://nobleid.org/work/w1/20260515/C40C3CD4)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

Stéphane Bessy

Johannes Pardey

Lucas Picasarri‐Arrieta

Dieter Rautenbach

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy