activity
20072022
most citedBinary matroids and local complementation

17 citations · 71 across the 32 of their papers we have counts for

collaborators
Showing math.COShow all

22 papers · 1 filter

math.CO2021

A note on geometric duality in matroid theory and knot theory

Lorenzo Traldi

We observe that for planar graphs, the geometric duality relation generates both 2-isomorphism and abstract duality. This observation has the surprising consequence that for links,…

math.CO2020

Matroids that classify forests

Lorenzo Traldi

Elementary arguments show that a tree or forest is determined (up to isomorphism) by binary matroids defined using the adjacency matrix.

math.CO2019

A Characterization of Circle Graphs in Terms of Total Unimodularity

Robert Brijder, Lorenzo Traldi

A graph has an associated multimatroid , which is equivalent to the isotropic system of studied by Bouchet. In previous work it was shown that is a ci…

math.CO2017

Planarity, duality and Laplacian congruence

Derek A. Smith, Lorenzo Traldi, William Watkins

We discuss the connections tying Laplacian matrices to abstract duality and planarity of graphs.

math.CO2017

A Characterization of Circle Graphs in Terms of Multimatroid Representations

Robert Brijder, Lorenzo Traldi

The isotropic matroid of a looped simple graph is a binary matroid equivalent to the isotropic system of . In general, is not regular, so it cannot b…

math.CO2016★ 2 cited

Circuit partitions and signed interlacement in 4-regular graphs

Lorenzo Traldi

Let be a 4-regular graph. Each circuit partition of has a corresponding touch-graph ; the circuits in correspond to vertices of , and the vertices o…