Alon–Hefetz–Krivelevich–Tyomkyn sparse-edge decay conjecture
Statement
For a graph , let be the number of edges induced by a uniformly random -vertex subset, and define
with
Sparse-edge decay conjecture. For all with
we have
This conjecture predicts that the asymptotic inducibility tends to zero when the induced edge count and its complementary count both grow faster than linearly in . The supplied text does not state whether this conjecture has been resolved.
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.