Research-Stack/6-Documentation/tiddlywiki-local/wiki/tiddlers/Witness-Regularized Burgers_GPE.tid
Brandon Schneider eff316ff3f wip: refined investigation script for Erdős–Gyárfás conjecture
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.
2026-05-08 14:50:03 -05:00

9 lines
229 B
Text

created: 20260507000000000
modified: 20260507000000000
tags: ResearchStack Alias
title: Witness-Regularized Burgers/GPE
type: text/vnd.tiddlywiki
! Witness-Regularized Burgers/GPE
Alias for [[Witness-Regularized Burgers GPE]].