A constructive characterisation of circuits in the simple (2,1)‐sparse matroid

DOI10.1002/jgt.22245zbMath1398.05051arXiv1604.05226OpenAlexW2792101960MaRDI QIDQ4553733

Anthony Nixon, Thomas A. McCourt

Publication date: 31 October 2018

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.05226

zbMATH Keywords

rigiditycount matroidconstructive characterisation

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99)

This page was built for publication: A constructive characterisation of circuits in the simple (2,1)‐sparse matroid