ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let XαX^{\alpha} be an rr-fold cover of a graph XX, where ξ(Xα,t)\xi(X^{\alpha},t) is the transversal polynomial and deg⁡(ξ(Xα,t))\deg(\xi(X^{\alpha},t)) is the maximum number of edges satisfied by a labelling of XX. For all ϵ,δ>0\epsilon,\delta>0, there exists r=r(ϵ,δ)r=r(\epsilon,\delta) such that, given an rr-fold cover XαX^{\alpha} of a graph XX, it is NP-hard to distinguish between the following two cases:

  1. deg⁡(ξ(Xα,t))≥(1−ϵ)∣E(X)∣\deg(\xi(X^{\alpha},t))\geq(1-\epsilon)|E(X)|;
  2. deg⁡(ξ(Xα,t))≤δ∣E(X)∣\deg(\xi(X^{\alpha},t))\leq\delta|E(X)|.

This is the Unique Games Conjecture, a central complexity-theoretic hypothesis whose truth would imply optimality results for approximation algorithms for several NP-hard problems. In this formulation, the degree of the transversal polynomial records the maximum number of edges satisfied by a labelling; the source provides no resolution of the conjecture.

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.