Jagdeep Singh

collaborators

2 papers

math.CO2026

Degeneracy: From Graphs to Matroids

Allan Bickle, James Dylan Douthitt, Wayne Ge +1

A graph is $k$ -degenerate if every subgraph has a vertex of degree at most $k$ . We extend this notion to matroids, defining a loopless matroid $M$ to be $k$ -degenerate if every res…

math.CO2026

The connected binary matroids with a pair of elements in no non-spanning circuits

Wayne Ge, James Oxley, Jagdeep Singh

Let $M$ be a simple connected binary matroid, and let $e$ and $f$ be distinct elements of $M$ . It is well known that, when the only circuits containing $e$ are spanning, $M$ is a c…