ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be the Cayley graph of a Coxeter group, and let QdQ_d be the largest subgraph of GG isomorphic to a cube. Write κ(G)=d\boldsymbol{\kappa}(G)=d for its dimension, and let σ(G)\sigma(G) denote the least possible maximum degree of an induced subgraph on more than half the vertices of GG. Sensitivity conjecture. The graph GG contains a set KK of more than half its vertices such that the subgraph induced by KK has maximum degree ⌈d⌉\lceil\sqrt{d}\rceil; equivalently,

σ(G)=⌈κ(G)⌉.\sigma(G)=\lceil\sqrt{\kappa(G)}\rceil.

This conjecture proposes that the lower bound for sensitivity in Cayley graphs is attained for every Cayley graph of a Coxeter group. The preceding results establish the bound for several Coxeter groups, while the available evidence is based largely on computational results and the general statement remains open.

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.