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)?

Erdős Problems records this as proved (Lean).

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal1 retained
  4. Resolutionproved (Lean)
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Open the work surface
Where the source files it274 share a topic
Graph Theory275
None carries a Standing. Browse the topic.
Start workOpen sources