Frontier Hall obstructions for exact distance shells
Statement
Conjecture 6.13. Any simple digraph with no directed cycles of length at most k has a vertex
v such that |N +
k
(v)| ≥ | N +
k−1
(v)|.
Serge Burckel also asked the following structural question:
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.