Repeating one ten-vertex graph makes two six-vertex shapes equally common
How often can six points in a network form a branching tree, or a loop with a single point attached? Repeating the same ten-point network makes each shape appear in about 4.32% of six-point groups, so reaching that frequency for one costs nothing for the other. Both rates come close to the separate computer estimates of what is possible; the exact maxima are still unknown. Repeated equal-part expansions of the Petersen graph give induced density 480/11111 for both the tree with arms 1, 2, 2 and the pentagon with a leaf. This raises the respective Table 3 lower bounds of Bodnár et al. from 0.0293174 and 0.0279082 to 0.0432004320…, within 4 × 10⁻⁸ of both numerical upper estimates. For either target the Petersen seed is uniquely optimal among balanced regular seeds with no triangles or four-cycles, and equal proportions uniquely maximize density among nondegenerate Petersen weightings. Finding published by Mutuo Research. Read it online: https://mutuo-research.vercel.app/papers/petersen-paired-inducibility/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.24424116
- Primary Topic
- Limits and Structures in Graph Theory
- Type
- preprint