Facts
Citation
URLhttps://en.wikipedia.org/wiki/Hirsch_conjecture
Sources
Hirsch Conjecture (Wikipedia)
Lead sectionQuote, Lead section
In mathematical programming and polyhedral combinatorics, the Hirsch conjecture is the statement that the edge-vertex graph of an n-facet polytope in d-dimensional Euclidean space has diameter no more than n - d.
Claims Backed By This Source (13 claims)
This source backs 13 claims across the atlas. As facts: 6 well-attested, 1 popular myth - corrected. As cited relationships: 2 holds. Plus 4 entities citing it as a general reference with no single fact or relationship attached.
Disposition By Topic
- Conjectures, 12 claims: 5 well-attested, 1 popular myth - corrected, 2 holds, 4 general references.
- Sources, 1 claims: 1 well-attested.
Popular myth - corrected
1Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.