Back to search

University of Waterloo

The Cycling Property for the Clutter of Odd st-Walks

Abstract

dc:description.abstract

A binary clutter is cycling if its packing and covering linear program have integral optimal solutions for all Eulerian edge capacities. We prove that the clutter of odd st- walks of a signed graph is cycling if and only if it does not contain as a minor the clutter of odd circuits of K5 nor the clutter of lines of the Fano matroid. Corollaries of this result include, of many, the characterization for weakly bipartite signed graphs, packing two- commodity paths, packing T-joins with small |T|, a new result on covering odd circuits of a signed graph, as well as a new result on covering odd circuits and odd T-joins of a signed graft.

Degree

thesis:*
Grantor dc:publisher
University of Waterloo
Year dc:date.issued
2014

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Abdi, Ahmad

Subjects

dc:subject × 4

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10012/8194

Chain of custody

source
Harvested from
University of Waterloo
Base URL
dspacemainprd01.lib.uwaterloo.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Abdi, Ahmad. The Cycling Property for the Clutter of Odd st-Walks. University of Waterloo, 2014. http://hdl.handle.net/10012/8194