# Erdős–Gyárfás conjecture

> unproven conjecture that every graph with minimum degree 3 contains a simple cycle whose length is a power of two

**Wikidata**: [Q3686826](https://www.wikidata.org/wiki/Q3686826)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Erdős–Gyárfás_conjecture)  
**Source**: https://4ort.xyz/entity/erd-s-gy-rf-s-conjecture


## References

1. Freebase Data Dumps. 2013