The arbitrary-group induced removal conjecture
Statement
Fix a bipartite graph , and let be a finite group. A subset is -far from bi-induced--free if changing fewer than elements of cannot make it bi-induced--free. A uniform random map is a map chosen uniformly from all such maps, and it bi-induces when
for every edge-pair of the bipartition of .
Arbitrary-group induced removal conjecture. For every , if is -far from bi-induced--free, then
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.