Erdos Problem 99 with Finite Multiplicity

A proof of Erdos Problem 99 in the case of h(n) finite, meaning a finite number of diameter-minimizing sets of n points with minimum separation at least 1.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-15
DOI
https://doi.org/10.5281/zenodo.23387135
Primary Topic
Limits and Structures in Graph Theory
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Erdos Problem 99 with Finite Multiplicity

Naveen Stewart
Zenodo (CERN European Organization for Nuclear Research)
Limits and Structures in Graph Theory
article

Erdos Problem 99 with Finite Multiplicity

Naveen Stewart
article en

Abstract

A proof of Erdos Problem 99 in the case of h(n) finite, meaning a finite number of diameter-minimizing sets of n points with minimum separation at least 1.

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 5%
Limits and Structures in Graph Theory
DOIOpen Access PDFOpenAlex
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.