A new axiom system for matroids: 1. Uniform matroid recognition
Combinatorics
2024-02-15 v2
Abstract
In this paper, we give a new axioms system based on nonseparable flats with their ranks to define a matroid. We deduce a polynomial time algorithm for deciding if a given matroid (respectively, arbitrary structure) is an uniform matroid. This problem is intractable if we use an independence or an equivalent oracle.
Keywords
Cite
@article{arxiv.1703.03744,
title = {A new axiom system for matroids: 1. Uniform matroid recognition},
author = {Brahim Chaourar},
journal= {arXiv preprint arXiv:1703.03744},
year = {2024}
}
Comments
14 pages