ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with nn vertices, mm edges and no isolated vertices. The parameter g0(G)g_0(G) is the corresponding set-mapping parameter defined in the paper. Conjecture on g0(G)g_0(G). One has

g0(G)=O(mn+n).g_0(G)=O\left(\frac{m}{\sqrt n}+n\right).

This is proposed as an upper bound matching, up to logarithmic factors, the lower bounds established earlier in the paper. The conjecture remains open in the supplied context.

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.