Erdős problem 619 · problems.science

Erdős Problem 619 [EGR98, Er99]: For a triangle-free graph $G$ let $h_r(G)$ be the smallest number of edges that need to be added to $G$ so that it has diameter $r$ (while preserving the property of being triangle-free). Is it true that there exists a constant $c>0$ such that if $G$ is a connected graph on $n$ vertices then $h_4(G)<(1-c)n$ ?

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:3618581dd14a27c889f61276b204cee0f613d53edf9c88c8525c25a89256682e
Metadata: sha256:7590c27b5106cbaead4e96307a42ba15c567da0cd5ba1b015ced1da9189e962d
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:55569049778fdeb2c7811bde44587f9c837b41dadcb986c284c0f49b2c4f4284

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207

Upstream source Inspect records Source JSON

Result history

Correction history

Exact provenance

Search problems.science