coloring_nested_tire_graphs: 6-hour counterexample search complete (2297 pairs)

Browse Source

Final tally across γ ∈ {3,...,15,18,21}:
- 2297 total pairs tested
- 48 strict-Latin (all-3-faces) counterexamples
- 0 threshold-satisfying (m_1 ≥ γ AND k_2 ≥ γ) counterexamples (882 such pairs)

Refined conjecture (with m_1 ≥ γ precondition) holds across all tested
threshold-satisfying pairs up to γ = 12. For γ ≥ 13, threshold pairs
were unreachable under the n ≤ 27 memory cap (m_1 ≤ 27 - γ < γ).

All 48 strict-Latin CEs violate the threshold on at least one side,
consistent with the saturation behavior identified in step 1.

Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>

...

This commit is contained in:

didericis

2026-05-26 09:33:23 -04:00

parent 56ebf49b48

commit d893860166

1 changed files with 2516 additions and 0 deletions

Show all changes Ignore whitespace when comparing lines Ignore changes in amount of whitespace Ignore changes in whitespace at EOL

Download Patch File Download Diff File Expand all files Collapse all files

papers/coloring_nested_tire_graphs/experiments/counterexample_search.log

+2516

File diff suppressed because it is too large Load Diff