trees

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