Tag

exhaustive-search

2 entries

Writing1

Checking an Erdős conjecture on every tree up to a size rules out small counterexamples but does not prove it. What such a check shows and how it is made.
WritingWhy checking a math conjecture on every case up to a size is not a proof· Oct 24, 2026

Result1

An Erdős conjecture: in every tree, and every forest, the number of ways to pick k vertices with no two joined rises, then falls, as k grows. I checked every tree three sizes past the old limit; it held.
RecordPublishedChecking an Erdős conjecture on every tree, three sizes further than before· Aug 4, 2026