Even Circuits in Oriented Matroids

10/18/2020
by   Karl Heuer, et al.
0

In this paper we generalise the even directed cycle problem, which asks whether a given digraph contains a directed cycle of even length, to orientations of regular matroids. We define non-even oriented matroids generalising non-even digraphs, which played a central role in resolving the computational complexity of the even dicycle problem. Then we show that the problem of detecting an even directed circuit in a regular matroid is polynomially equivalent to the recognition of non-even oriented matroids. Our main result is a precise characterisation of the class of non-even oriented bond matroids in terms of forbidden minors, which complements an existing characterisation of non-even oriented graphic matroids by Seymour and Thomassen.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

07/28/2021

On fractional version of oriented coloring

We introduce the fractional version of oriented coloring and initiate it...
10/04/2019

A Note on Directed Treewidth

We characterise digraphs of directed treewidth one in terms of forbidden...
04/07/2019

Graph pattern detection: Hardness for all induced patterns and faster non-induced cycles

We consider the pattern detection problem in graphs: given a constant si...
04/23/2019

Cops and robbers on oriented toroidal grids

The game of cops and robbers is a well-known game played on graphs. In t...
03/16/2021

A Hamilton Cycle in the k-Sided Pancake Network

We present a Hamilton cycle in the k-sided pancake network and four comb...
08/20/2020

Fast recognition of some parametric graph families

We identify all [1, λ, 8]-cycle regular I-graphs and all [1, λ, 8]-cycle...
05/20/2020

Oriented Convex Containers of Polygons – II

We define an 'oriented convex region' as a convex region with a directio...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.