ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DD be an oriented graph, and let δ(D)\delta(D) denote its minimum degree. For positive integers rr and ss, write K⃗s,s\vec{K}_{s,s} 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 DD with

δ(D)≥f(2s,f(r,s))\delta(D) \geq f_{}(2s,f_{}(r,s))

contains a copy of K⃗s,s\vec{K}_{s,s} or an induced restricted antidirected subdivision of KrK_r.

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 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.