ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Compactness implies that for every ε>0\varepsilon>0 there is K>0K>0 such that every finite graph can be approximated within error ε\varepsilon by a finite graph of size KK. Give an estimate for KK in terms of ε\varepsilon.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.