Skip to content

Erdős problem 618

Start work

For a triangle-free graph GG let h2(G)h_2(G) be the smallest number of edges that need to be added to GG so that it has diameter 22 and is still triangle-free. Is it true that if GG has maximum degree o(n1/2)o(n^{1/2}) then h(G)=o(n2)h(G)=o(n^2)?

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

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

Exact provenance

Problem row
sha256:ad4919dfd42809668f325c97cad5e373d167d5a754ead616452fd8095e8c5110
Metadata
sha256:7447e51006fadfd1bfcd4f24912c9142d76bd2d7e757d87906466fa89d16c9ef
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:714a083d4a696accd3333d21c3b9b14c3a7099e7de73d005db8a20f0804414bf
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON