ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,E)G=(V,E) be a graph on nn vertices. For t∈Nt\in\mathbb{N} and β>0\beta>0, call GG (β,t)(\beta,t)-intersecting if, for every tt subsets S1,…,St⊆VS_1,\dots,S_t\subseteq V of size βn\beta n and every tt bijections πi:Si→[βn]\pi_i:S_i\to[\beta n], there exist j,k∈[βn]j,k\in[\beta n] such that

(πi−1(j),πi−1(k))∈E(\pi_i^{-1}(j),\pi_i^{-1}(k))\in E

for every i∈[t]i\in[t]. Let χeq(G)\chi_{\rm eq}(G) denote the equitable chromatic number. Intersecting-graph hardness conjecture. For every t∈Nt\in\mathbb{N} and all sufficiently large K∈NK\in\mathbb{N}, it is NP\mathcal{NP}-hard to distinguish between the following cases:

  1. χeq(G)≤K\chi_{\rm eq}(G)\leq K;
  2. GG is (1/Kt,t)(1/K^t,t)-intersecting.

The conjecture is introduced as a gap problem whose hardness would imply the one-versus-tt acquaintance-time conjecture; no proof or resolution is given in the source.

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.