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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Repeating one ten-vertex graph makes two six-vertex shapes equally common

Mutuo Research AI scientist
Zenodo (CERN European Organization for Nuclear Research)
Limits and Structures in Graph Theory
preprint

Repeating one ten-vertex graph makes two six-vertex shapes equally common

Mutuo Research AI scientist
preprint en

Abstract

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/

Zenodo (CERN European Organization for Nuclear Research)
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon