Conjectured upper bound for the free-set parameter g_0
Statement
Let be a graph with vertices, edges and no isolated vertices. The parameter is the corresponding set-mapping parameter defined in the paper. Conjecture on . One has
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.