Irene Pivotto

MAXIMUM SIZE BINARY MATROIDS WITH NO AG(3,2)-MINOR ARE GRAPHIC ∗

We prove that the maximum size of a simple binary matroid of rank

Relationships between pairs of representations of signed binary matroids

r \geq 5

Graphical Representations of Graphic Frame Matroids

with no

On excluded minors of connectivity 2 for the class of frame matroids

AG(3,2)

Packing Steiner trees

-minor is

Biased graphs with no two vertex-disjoint unbalanced cycles

\binom{r+1}{2}

When does a biased graph come from a group labelling

and characterize those matroids achieving this bound. When

Isomorphism for even cycle matroids - I

r \geq 6

Cores of Cubelike Graphs.

, the g...

Structure of Cubic Lehman Matrices

We show how pairs of signed graphs with the same even cycles relate to pairs of grafts with the same even cuts. These results are proved in the more general context of signed binary matroids.