Erdős–Diophantine graph

Summary

Erdős–Diophantine graph is a mathematical concept^[1]. It draws 3 Wikipedia views per month (mathematical_concept category, ranking #254 of 1,007).^[2]

Key Facts

• Erdős–Diophantine graph's instance of is recorded as mathematical concept^[3].
• Paul Erdős is named after Erdős–Diophantine graph^[4].
• Diophantus of Alexandria is named after Erdős–Diophantine graph^[5].
• Erdős–Diophantine graph's subclass of is recorded as graph^[6].
• Erdős–Diophantine graph's subclass of is recorded as locus^[7].
• Erdős–Diophantine graph's Freebase ID is recorded as /m/02wxdyp^[8].
• Erdős–Diophantine graph's described by source is recorded as Erdős–Anning theorem^[9].

Why It Matters

Erdős–Diophantine graph draws 3 Wikipedia views per month (mathematical_concept category, ranking #254 of 1,007).^[2]