{"id":"https://openalex.org/keywords/hirsch-conjecture","display_name":"Hirsch conjecture","description":"The Hirsch conjecture is a statement in polyhedral combinatorics bounding shortest paths between vertices of a convex polytope.","display_name_alternatives":["Hirsch's conjecture"],"ids":{"openalex":"https://openalex.org/keywords/hirsch-conjecture","wikidata":"https://www.wikidata.org/wiki/Q2993326"},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.604,"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.604,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.25,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":179,"cited_by_count":6743,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/hirsch-conjecture","updated_date":"2026-11-22T04:06:09","created_date":"2022-04-12T19:38:12"}
