Petersen substitutions and the inducibility of the six-vertex tree F26

Let F = F26 be the six-vertex tree with three arms of lengths 1, 2 and 2. Its induced density tends to 480/11111 in balanced iterated substitutions of the Petersen graph. For arbitrary graphs, a rational certificate gives the upper bound 233973195106737927117969229/5415987671873538702683668480. The two bounds differ by less than 3.471 × 10⁻⁸. Among graphs containing neither an induced bull nor an induced house, the exact value is 480/11111. A graph in this class on n ≥ 1 vertices contains at most 2(n⁶ − n)/33333 induced copies of F, with equality precisely for the balanced Petersen substitutions on powers of ten vertices. In this class we also characterize equality for nonnegative vertex weights of total mass one. Both certificates can be checked offline using the accompanying data and programs.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24341541
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

Petersen substitutions and the inducibility of the six-vertex tree F26

Oleg Kyzlasov
1 links
Zenodo (CERN European Organization for Nuclear Research)
Limits and Structures in Graph Theory
preprint

Petersen substitutions and the inducibility of the six-vertex tree F26

Oleg Kyzlasov
preprint en

Abstract

Let F = F26 be the six-vertex tree with three arms of lengths 1, 2 and 2. Its induced density tends to 480/11111 in balanced iterated substitutions of the Petersen graph. For arbitrary graphs, a rational certificate gives the upper bound 233973195106737927117969229/5415987671873538702683668480. The two bounds differ by less than 3.471 × 10⁻⁸. Among graphs containing neither an induced bull nor an induced house, the exact value is 480/11111. A graph in this class on n ≥ 1 vertices contains at most 2(n⁶ − n)/33333 induced copies of F, with equality precisely for the balanced Petersen substitutions on powers of ten vertices. In this class we also characterize equality for nonnegative vertex weights of total mass one. Both certificates can be checked offline using the accompanying data and programs.

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