Ordering of the elements of a matroid such that its consecutive w elements are independent

DOI10.1016/0012-365X(88)90209-9MaRDI QIDQ1110522zbMATH OpenOpenAlexFDO

Authors Yoji Kajitani, Shuichi Ueno, Hiroshi Miyano

Publication date 1988

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(88)90209-9

zbMATH Keywords

orderings on a matroidwith L-ind orderingwth C-ind ordering

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Review text

Given a positive integer w, the authors consider two special orderings on a matroid M, namely the wth L-ind or wth C-ind ordering, respectively. The main purpose of the paper under review is to characterize the matroids admitting these orderings. While for the wth L-ind orderable matroids a complete characterization is given, for the wth C-ind orderable ones only a necessary condition is presented that is conjectured to be sufficient, as well. This conjecture is verified for several classes of matroids. For details the reader should consult the paper itself.

Recommendations

• Ordering circuits of matroids
• Matroid optimization with the interleaving of two ordered sets
• Ordered matroids and regular independence systems
• Cyclic orderings and cyclic arboricity of matroids
• Active orders for matroid bases

Cites work

• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 3893220 (Why is no real title available?)
• Minimum partition of a matroid into independent subsets

Cited in

(21)

• Transforming a graph into a 1-balanced graph
• Equicovering matroids by distinct bases
• Ordering circuits of matroids
• On a base exchange game on bispanning graphs
• Cyclic orderings and cyclic arboricity of matroids
• On sequential basis exchange in matroids
• On serial symmetric exchanges of matroid bases
• Weighted exchange distance of basis pairs
• Partitioning into common independent sets via relaxing strongly base orderability
• Cyclically orderable generalized Petersen graphs
• Exchange Distance of Basis Pairs in Split Matroids
• Cyclic base ordering of generalized Petersen graphs
• Cyclic orderings of paving matroids
• Cyclic base ordering of certain degenerate graphs
• Uniform density in matroids, matrices and graphs
• Bases-cobases graphs and polytopes of matroids
• Cyclic ordering of split matroids
• Reconfiguration of basis pairs in regular matroids
• Cyclic ordering of edges without long acyclic subsequences
• Hamiltonian connectivity of some base-cobase graphs
• Towards the proximity conjecture on group-labeled matroids

This page was built for publication: Ordering of the elements of a matroid such that its consecutive w elements are independent

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1110522)