Facts
Citation
URLhttps://en.wikipedia.org/wiki/Friendship_theorem
Sources
Friendship theorem, Wikipedia
Lead sectionQuote, Lead section
In the mathematical field of graph theory, the friendship graph (or Dutch windmill graph or n-fan) Fn is a planar, undirected graph with 2n + 1 vertices and 3n edges.
Claims Backed By This Source (6 claims)
This source backs 6 claims across the atlas. As facts: 4 well-attested. Plus 2 entities citing it as a general reference with no single fact or relationship attached.
Disposition By Topic
- Theorems, 5 claims: 3 well-attested, 2 general references.
- Sources, 1 claims: 1 well-attested.
Reader 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.