Erdős–Pósa theorem
min-max theorem in graph theory
Press Enter · cited answer in seconds
0 sources
Erdős–Pósa theorem
Summary
Erdős–Pósa theorem is a theorem[1]. It draws 7 Wikipedia views per month (theorem category, ranking #274 of 1,306).[2]
Key Facts
- Erdős–Pósa theorem's instance of is recorded as theorem[3].
- Paul Erdős is named after Erdős–Pósa theorem[4].
- Lajos Pósa is named after Erdős–Pósa theorem[5].
- Erdős–Pósa theorem's part of is recorded as list of theorems[6].
- Erdős–Pósa theorem's Freebase ID is recorded as /m/05q7fvx[7].
- Erdős–Pósa theorem's statement describes is recorded as feedback vertex set number[8].
- Erdős–Pósa theorem's statement describes is recorded as cycle packing number[9].
- Erdős–Pósa theorem's maintained by WikiProject is recorded as WikiProject Mathematics[10].
- Erdős–Pósa theorem's Microsoft Academic ID is recorded as 2777446746[11].
Why It Matters
Erdős–Pósa theorem draws 7 Wikipedia views per month (theorem category, ranking #274 of 1,306).[2]