Local edge budgets for Thomassé's nonneighbor conjecture
Statement
Conjecture 6. 1 2. (Thomass´ e) Let G be a digraph with no directed cycle of length at most three. Then there is a vertex v ∈ V (G) with δ+(v) at most the number of non-neighbors of v.
The following generalization of second neighborhood to kth neighborhood was taken from a (unpublished) paper of Serge Burckel: 7
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.