mirror of
https://github.com/allaunthefox/Research-Stack.git
synced 2026-07-31 03:05:21 +00:00
Created refined investigation script for Erdős–Gyárfás conjecture where previous test found no power-of-two cycles (conjecture holds: False). Refinements: - Regular graph construction (all vertices same degree) - Exhaustive DFS cycle detection - More samples per n (5 instead of 3) - Extended n values [8, 10, 12, 14, 16] Goal: Determine if previous negative result was due to random graph construction or if regular graphs with exhaustive cycle detection find power-of-two cycles. Script created: investigate_erdos_gyarfas_refined.py Execution canceled by user - awaiting further instructions. |
||
|---|---|---|
| .. | ||
| settings.json | ||