{"id":"https://openalex.org/keywords/maximum-matching","display_name":"maximum matching","description":"A largest possible set of edges in a graph such that no two selected edges share a vertex, studied in graph theory.","display_name_alternatives":["maximum cardinality matching","max matching","maximum matchings","maximum-size matching"],"ids":{"openalex":"https://openalex.org/keywords/maximum-matching","wikidata":"https://www.wikidata.org/wiki/Q65088751"},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3957,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3957,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.1464,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":2654,"cited_by_count":54395,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/maximum-matching","updated_date":"2026-10-24T04:06:44","created_date":"2026-09-30T00:00:00"}