ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let D=(V,E)D=(V,E) be an oriented graph: a finite directed graph with no self-loops, no parallel edges, and no directed cycle of length two (equivalently, for all u,v∈Vu,v \in V at most one of (u,v)(u,v) and (v,u)(v,u) lies in EE). For a vertex v∈Vv \in V let

N+(v)={u∈V:(v,u)∈E}N^{+}(v)=\{u \in V : (v,u) \in E\}

be the first neighborhood of vv, i.e. the set of vertices at directed distance one from vv, and let

N++(v)=(⋃u∈N+(v)N+(u))∖(N+(v)∪{v})N^{++}(v)=\Big(\bigcup_{u \in N^{+}(v)} N^{+}(u)\Big) \setminus \big(N^{+}(v) \cup \{v\}\big)

be the second neighborhood of vv, i.e. the set of vertices at directed distance exactly two from vv. The sets N+(v)N^{+}(v) and N++(v)N^{++}(v) are disjoint and neither contains vv.

Then every oriented graph DD has a vertex v∈Vv \in V with

∣N++(v)∣≥∣N+(v)∣.|N^{++}(v)| \ge |N^{+}(v)|.

In particular, this holds when DD is a tournament, i.e. an orientation of a complete graph.

Record

Added
Links

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.