A Note on Arc-Disjoint Cycles in Bipartite Tournaments

02/17/2020

∙

We show that for each non-negative integer k, every bipartite tournament either contains k arc-disjoint cycles or has a feedback arc set of size at most 7(k - 1).

READ FULL TEXT

A Note on Arc-Disjoint Cycles in Bipartite Tournaments

Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles

The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments

Cutting cycles of rods in space is FPT

Physical Zero-knowledge Proofs for Flow Free, Hamiltonian Cycles, and Many-to-many k-disjoint Covering Paths

Storing cycles in Hopfield-type networks with pseudoinverse learning rule: admissibility and network topology

A Note on Generating Sets for Semiflows

Some `converses' to intrinsic linking theorems

A Note on Arc-Disjoint Cycles in Bipartite Tournaments

Related Research

Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles

The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments

Cutting cycles of rods in space is FPT

Physical Zero-knowledge Proofs for Flow Free, Hamiltonian Cycles, and Many-to-many k-disjoint Covering Paths

Storing cycles in Hopfield-type networks with pseudoinverse learning rule: admissibility and network topology

A Note on Generating Sets for Semiflows

Some `converses' to intrinsic linking theorems