Restricted antidirected subdivision conjecture for oriented graphs
Statement
Let be an oriented graph, and let denote its minimum degree. For positive integers and , write for the consistently oriented complete bipartite graph, and call an antidirected subdivision of a graph restricted when all its branch vertices are sources.
Restricted antidirected subdivision conjecture. Every oriented graph with
contains a copy of or an induced restricted antidirected subdivision of .
This conjecture proposes a more precise version of the preceding minimum-degree result for oriented graphs. The supplied text does not indicate whether it has been resolved.
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.