ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a triangle-free graph GG on Fin⁡(n)\operatorname{Fin}(n), define h2(G)h_2(G) to be the smallest number of edges that must be added to GG so that the resulting graph remains triangle-free and has diameter at most 22; that is, every two distinct vertices are adjacent or have a common neighbor. If no such supergraph exists, take h2(G)=0h_2(G)=0. Is it true that for every sequence of triangle-free graphs (Gn)n∈N(G_n)_{n\in\mathbb N}, if the maximum degree satisfies max⁡deg⁡(Gn)=o(n1/2),\max\deg(G_n)=o(n^{1/2}), then h2(Gn)=o(n2)?h_2(G_n)=o(n^2)? Equivalently, for every family GG assigning a simple graph GnG_n on Fin⁡(n)\operatorname{Fin}(n) to each nn, if every GnG_n is triangle-free and (n↦max⁡deg⁡(Gn))=o(n↦n1/2),\bigl(n\mapsto\max\deg(G_n)\bigr)=o\bigl(n\mapsto n^{1/2}\bigr), then (n↦h2(Gn))=o(n↦n2).\bigl(n\mapsto h_2(G_n)\bigr)=o\bigl(n\mapsto n^2\bigr).

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.