cjc0013/ouroboros-erdos64-a100-campaign

Ouroboros Erdős #64 A100 campaign This is a process-and-evidence archive for an AI-directed computational campaign on the open Erdős–Gyárfás conjecture (Erdős Problem #64): every finite graph of minimum degree at least 3 should contain a cycle whose length is a power of two. Read this first This campaign did not solve the conjecture and did not produce a counterexample. It records how Ouroboros used a Google Colab A100 runtime, durable per-cycle checkpoints… See the full description on the dataset page: https://huggingface.co/datasets/cjc0013/ouroboros-erdos64-a100-campaign.

<iframe src="https://silytics.si/embed/item/420638ae-d413-4920-8ef7-8ae0b37315a4" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Silytics shows public metadata from Hugging Face and links to the original. Information may be incomplete or out of date. Last refreshed 18 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.