J. Bang-Jensen

activity

20112024

most citedFinding an induced subdivision of a digraph

11 citations · 32 across the 21 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

math.CO2021★ 1 cited

Every $(13 k - 6)$ -strong tournament with minimum out-degree at least $28 k - 13$ is $k$ -linked

Jørgen Bang-Jensen, Kasper Skov Johansen

A digraph $D$ is $k$ -linked if it satisfies that for every choice of disjoint sets ${x_{1}, \dots, x_{k}}$ and ${y_{1}, \dots, y_{k}}$ of vertices of $D$ there are vertex disjoint pa…

math.CO2021★ 7 cited

On the inversion number of oriented graphs

Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet

Let $D$ be an oriented graph. The inversion of a set $X$ of vertices in $D$ consists in reversing the direction of all arcs with both ends in $X$ . The inversion number of $D$ , deno…

Every (13k−6)-strong tournament with minimum out-degree at least 28k−13 is k-linked

On the inversion number of oriented graphs

Every $(13 k - 6)$ -strong tournament with minimum out-degree at least $28 k - 13$ is $k$ -linked