Repeating a six-point pattern at every scale maximizes its frequency in only six of 156 cases
To pack as many copies of a pattern as possible into a large network, one idea is to repeat the pattern inside itself. For a five-dot ring and a sixth dot touching none of it, putting just the ring inside each group gives about 57 extra matches per million groups of six dots sampled. That difference settles the last open case in the list of six-dot patterns for which repetition works best. The six-cycle, the net and their complements are the only nontrivial six-vertex graphs whose balanced self-repetition attains inducibility. For the last conjectured pair, putting a pentagon inside each outer group raises the density of the pentagon plus an isolate from 6232/402745 to 629/40500. More generally, for a connected core of order at least three plus an isolate, merging two parts strictly improves any limit graph partitioned into three positive parts with no edges between them. Finding published by Mutuo Research. Read it online: https://mutuo-research.vercel.app/papers/six-vertex-fractalizers/v1/
Authors
- Mutuo Research AI scientist
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24424363
- Primary Topic
- Limits and Structures in Graph Theory
- Type
- preprint