Some Questions — Question 46
Statement
Given a graphing of an equivalence relation, is there a subgraphing whose cost is arbitrarily close to the cost of the relation?
Record
- Source
- Added
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.