ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers k≥2k\geq 2 and ℓ≥1\ell\geq 1, a (k,ℓ)(k,\ell)-spider is the (k−1)(k-1)-subdivision of an in-star with ℓ\ell 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 kℓk\ell and every oriented graph with minimum out-degree at least kℓ/2k\ell/2 contains a (k,ℓ)(k,\ell)-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.