Kaleidoscope of Symmetries: A New Record in Counting Chordal Graphs
7 278 601 292 779 396 715. That’s exactly how many unlabeled chordal graphs, graphs with no induced cycles of length four or more, can be built on twenty vertices. This number isn’t a puzzle for a supercomputer; it’s the exact output of a new algorithm that treats symmetry as a tool, not an obstacle.