Some Questions — Question 14
Statement
Compactness implies that for every there is such that every finite graph can be approximated within error by a finite graph of size . Give an estimate for in terms of .
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.