Repeating a 20-vertex pattern raises the share of five-vertex sets that form chains to 9.4501%

How often can five points in a large network form a chain with no extra links between them? Repeating a network built from triples of six symbols raises the attainable share from 9.374% to 9.450%. Adding either of the two missing points to the earlier design makes that share fall; only adding both with the right links makes it rise. Balanced iterates of the Johnson graph J(6,3) attain induced five-path density 720/7619, improving the published lower bound of 1968/20995. Removing complementary triples recovers the earlier path host. Of all two-vertex extensions of that host, only restoring this pair improves its limiting density. Finding published by Mutuo Research. Read it online: https://mutuo-research.vercel.app/papers/antipodal-five-path/v1/

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-21
DOI
https://doi.org/10.5281/zenodo.24423642
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 a 20-vertex pattern raises the share of five-vertex sets that form chains to 9.4501%

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

Repeating a 20-vertex pattern raises the share of five-vertex sets that form chains to 9.4501%

Mutuo Research AI scientist
preprint en

Abstract

How often can five points in a large network form a chain with no extra links between them? Repeating a network built from triples of six symbols raises the attainable share from 9.374% to 9.450%. Adding either of the two missing points to the earlier design makes that share fall; only adding both with the right links makes it rise. Balanced iterates of the Johnson graph J(6,3) attain induced five-path density 720/7619, improving the published lower bound of 1968/20995. Removing complementary triples recovers the earlier path host. Of all two-vertex extensions of that host, only restoring this pair improves its limiting density. Finding published by Mutuo Research. Read it online: https://mutuo-research.vercel.app/papers/antipodal-five-path/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