Uniform expansion bounds for graph nets
Statement
There is a positive function such that every graph with and maximum degree less than has for each -net graph . Is ? In particular, what is the behavior of this bound for -nets in a regular tree?
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.