ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix a bipartite graph FF, and let GG be a finite group. A subset A⊆GA \subseteq G is ϵ\epsilon-far from bi-induced-FF-free if changing fewer than ϵ∣G∣\epsilon |G| elements of AA cannot make it bi-induced-FF-free. A uniform random map is a map ϕ ⁣:V(F)→G\phi \colon V(F) \to G chosen uniformly from all such maps, and it bi-induces FF when

ϕ(u)+ϕ(v)∈A⟺uv∈E(F)\phi(u)+\phi(v) \in A \quad\Longleftrightarrow\quad uv \in E(F)

for every edge-pair (u,v)∈U×V(u,v) \in U \times V of the bipartition of FF.

Arbitrary-group induced removal conjecture. For every 0<ϵ<1/20 < \epsilon < 1/2, if A⊆GA \subseteq G is ϵ\epsilon-far from bi-induced-FF-free, then

Pr⁡ϕ ⁣:V(F)→G[ϕ bi-induces F]≥ϵOF(1).\Pr_{\phi \colon V(F) \to G}[\phi\text{ bi-induces }F] \geq \epsilon^{O_F(1)}.

This would extend the removal lemma from abelian groups to arbitrary groups. The claim is stated as open even for general abelian groups, and therefore remains open in the full arbitrary-group setting.

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.