Balogh et al.'s linear path-separating-system conjecture
Statement
Let be a graph on vertices. A path separating system of is a collection of paths in such that, for every ordered pair of distinct edges , some path contains but not . Balogh et al.'s conjecture. Every graph of order admits a path separating system of size . This strengthened conjecture was confirmed in 2023, when a separating path system of size at most was proved for every graph on vertices.
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.