Domination conjecture for neighborhoods in vertex-transitive reflection graphs
Statement
Let be a graph and a vertex. Define to be the subgraph induced by all vertices at distance at most from ; for vertex-transitive , write this graph as . Say that a graph dominates a graph when
for every graphon .
Neighborhood domination conjecture. If is a vertex-transitive reflection graph with diameter , then dominates for all .
The conjecture proposes a monotonicity principle for domination inequalities among metric neighborhoods in vertex-transitive reflection graphs. The supplied source gives no evidence of a resolution.
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.