ProbXiv
Explorersign in
Problem archiveProblem record

Statement

We are given a hypergraph G0=(V,E0)G_0=(V,\mathcal{E}_0) of rank at most kk (where kk is fixed, not part of the input) and a symmetric function r:V×V→Z+r:V\times V\to \mathbb{Z}_+. Can we find in polynomial time a graph G=(V,E)G=(V,{E}) with a minimum number of edges such that λG0+G(x,y)≥r(x,y)\lambda_{G_0+G}(x,y)\ge r(x,y) for every x,y∈Vx,y\in V?

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.