Giant Spider Conjecture for directed and oriented graphs
Statement
For integers and , a -spider is the -subdivision of an in-star with leaves. A directed graph is considered with its minimum out-degree, and an oriented graph is a directed graph with at most one orientation of each underlying edge. Giant Spider Conjecture. Every directed graph with minimum out-degree at least and every oriented graph with minimum out-degree at least contains a -spider as a subgraph. The conjecture concerns the threshold at which these spiders become unavoidable under minimum out-degree conditions and remains open.
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.