A note on mixed graphs and matroids

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

A mixed graph is a graph with some directed edges and some undirected edges. We introduce the notion of mixed matroids as a generalization of mixed graphs. A mixed matroid can be viewed as an oriented matroid in which the signs over a fixed subset of the ground set have been forgotten. We extend to mixed matroids standard definitions from oriented matroids, establish basic properties, and study questions regarding the reorientations of the unsigned elements. In particular we address in the context of mixed matroids the P-connectivity and P-orientability issues which have been recently introduced for mixed graphs.
6 pages, 1 figure

Keywords

Combinatorics, 05B35; 05C38

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/68758

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0310078
 http://arxiv.org/abs/math/0310078

Collections

arXiv