The Wikipedia article on Erdos-Gyarfas conjecture, consulted for its lead-section facts.
Facts
Citation
PublisherWikimedia Foundation
URLhttps://en.wikipedia.org/wiki/Erdos-Gyarfas_conjecture
Source TypeReference Work
Assessment
Reliability Tier2
General encyclopedia reference, actively edited; tier 2 matching the family's existing Wikipedia source entities. Sources
Erdos-Gyarfas Conjecture (Wikipedia)
Wikimedia FoundationLead sectionQuote, Lead section
In graph theory, the unproven Erdős-Gyárfás conjecture, made in 1995 by mathematician Paul Erdős and his collaborator András Gyárfás, states that every graph with minimum degree 3 contains a simple cycle whose length is a power of two.
Claims Backed By This Source (16 claims)
This source backs 16 claims across the atlas. As facts: 12 well-attested. Plus 4 entities citing it as a general reference with no single fact or relationship attached.
Disposition By Topic
- Conjectures, 12 claims: 8 well-attested, 4 general references.
- Sources, 4 claims: 4 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.