NP-hardness of approximating ultrafilter width under connectivity expansion
Statement
Let be a finite connectivity system. Its ultrafilter width is
provided that at least one such ultrafilter exists. Connectivity-system SSE-type hardness conjecture. Under a suitable Small Set Connectivity Expansion Hypothesis for connectivity systems, it is NP-hard to approximate within a constant factor. This is an expansion-based computational hardness claim; the supplied text does not state the precise hypothesis or establish the reduction, so the conjectured hardness remains open.
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.