Sensitivity conjecture for Cayley graphs of Coxeter groups
Statement
Let be the Cayley graph of a Coxeter group, and let be the largest subgraph of isomorphic to a cube. Write for its dimension, and let denote the least possible maximum degree of an induced subgraph on more than half the vertices of . Sensitivity conjecture. The graph contains a set of more than half its vertices such that the subgraph induced by has maximum degree ; equivalently,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.