Hardness of distinguishing low equitable chromatic number from intersecting graphs
Statement
Let be a graph on vertices. For and , call -intersecting if, for every subsets of size and every bijections , there exist such that
for every . Let denote the equitable chromatic number. Intersecting-graph hardness conjecture. For every and all sufficiently large , it is -hard to distinguish between the following cases:
- ;
- is -intersecting.
The conjecture is introduced as a gap problem whose hardness would imply the one-versus- acquaintance-time conjecture; no proof or resolution is given in the source.
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.