scientific article
From MaRDI portal
Publication:3135082
zbMath0784.05002MaRDI QIDQ3135082
Publication date: 22 September 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
connectivitybinary matroidsmatroid theorymatroid unionregular matroidssubmodular functionsternary matroids
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Trees, grids, and MSO decidability: from graphs to matroids, The moduli space of matroids, On the toric ideals of matroids of a fixed rank, Jones polynomial of knots formed by repeated tangle replacement operations, Evolutionary algorithms and matroid optimization problems, Uncoverings-by-bases for base-transitive permutation groups., Matroid tree-width, Antisymmetric flows in matroids, Representations of matroids and free resolutions for multigraded modules, Defining matroids through sequential selection, Circuits and cocircuits in regular matroids, On combinatorial optimization problems on matroids with uncertain weights, Extreme point axioms for closure spaces, Vertex-minors, monadic second-order logic, and a conjecture by Seese, The number of nowhere-zero flows on graphs and signed graphs, Enumerating disjunctions and conjunctions of paths and cuts in reliability theory, Combinatorics of multigraded Poincaré series for monomial rings, The homology of the cycle matroid of a coned graph, Enumerating orientations of the free spikes, The structure of 3-connected matroids of path width three, Bimatroids and Gauss decomposition, The structure of the 3-separations of 3-connected matroids. II., Edge-rooted forests and the \(\alpha\)-invariant of cone graphs, Closure axioms for a class of fuzzy matroids and co-towers of matroids, Matroids on convex geometries (cg-matroids), Static and dynamic source locations in undirected networks, The structure of 2-separations of infinite matroids, On the tropical Torelli map, A generalization of weight polynomials to matroids, Categories of \((I, I)\)-fuzzy greedoids, Estimates for a family of multi-linear forms, Covering directed graphs by in-trees, Modular elimination in matroids and oriented matroids, Automorphism groups of root system matroids, Some inequalities for the Tutte polynomial, Matching subspaces in a field extension., Detecting minors in matroids through triangles, A formula for simplicial tree-numbers of matroid complexes, A Helly type theorem for abstract projective geometries, Clones in 3-connected frame matroids, Matroids on convex geometries: subclasses, operations, and optimization, On the complexity of matroid isomorphism problem, Isotropical linear spaces and valuated Delta-matroids, On 3-connected minors of 3-connected matroids and graphs, Paths in circuit graphs of matroids, Rees cones and monomial rings of matroids, Maintaining 3-connectivity relative to a fixed basis, The structure of crossing separations in matroids, Generating cut conjunctions in graphs and related problems, A note on the sticky matroid conjecture, Pairs of chromatically equivalent graphs, Splitting off operation for binary matroids and its applications, Dirac's theorem on simplicial matroids, Glicci simplicial complexes, On cocircuit covers of bicircular matroids, On the chromatic number of an oriented matroid, On the \(K\)th best base of a matroid, Matroid enumeration for incidence geometry, Relations between the circumference and \(e\)-circumference of a matroid, An overview of channel assignment methods for multi-radio multi-channel wireless mesh networks, On \(k\)-connected \(\gamma\)-extensions of binary matroids, A MacWilliams type identity for matroids, Sufficient enlargements of minimal volume for finite-dimensional normed linear spaces, Rank functions of strict cg-matroids, Constructive characterizations of 3-connected matroids of path width three, Minimally 3-connected binary matroids, Clutters and circuits, On chromatic and flow polynomial unique graphs, A unified interpretation of several combinatorial dualities, The signed-graphic representations of wheels and whirls, Tutte polynomials computable in polynomial time, A rooted-forest partition with uniform vertex demand, Characterizations of \(\text{PG}(n-1,q)\setminus\text{PG}(k-1,q)\) by numerical and polynomial invariants, Almost-graphic matroids, Line-closed matroids, quadratic algebras, and formal arrangments, Ideal clutters, How is a chordal graph like a supersolvable binary matroid?, On the number of non-isomorphic matroids, The affine representation theorem for abstract convex geometries, The structure of the 3-separations of 3-connected matroids, A chain theorem for 4-connected matroids, Amalgams of extremal matroids with no \(U_{2,\ell +2}\)-minor, Clonal sets in \(GF(q)\)-representable matroids, Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization, Relative centers of motion, implicit bars and dead-center positions for planar mechanisms, A conjecture of Welsh revisited, Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid, A chain theorem for internally 4-connected binary matroids, Exposing 3-separations in 3-connected matroids, On excluded minors of connectivity 2 for the class of frame matroids, Symmetric and quasi-symmetric functions associated to polymatroids, The Buneman index via polyhedral split decomposition, Sensor networks: from dependence analysis via matroid bases to online synthesis, A polynomial invariant and duality for triangulations, The \(f\)-vector of a representable-matroid complex is log-concave, A solution to the combinatorial puzzle of Mayer's virial expansion, The multilinear algebra of José Dias da Silva and the Portuguese school of mathematics, On the \(t\)-term rank of a matrix, Quasi-matroidal classes of ordered simplicial complexes, On geometric posets and partial matroids, Vectors of matroids over tracts, Independence systems in gross-substitute valuations, Extensions of matroid covering and packing, Peripheral circuits in infinite binary matroids, On binary matroids without a \(P_{10}\)-minor, Matroid optimisation problems with nested non-linear monomials in the objective function, Improving the linear programming technique in the search for lower bounds in secret sharing, On critical exponents of Dowling matroids, Bouquet algebra of toric ideals, Graphic and cographic \(\Gamma\)-extensions of binary matroids, A higher Boltzmann distribution, Some heterochromatic theorems for matroids, Hodge theory for combinatorial geometries, Topological infinite gammoids, and a new Menger-type theorem for infinite graphs, Rough sets and matroids from a lattice-theoretic viewpoint, Planar arcs, Generalized matroids based on three-way decision models, An excluded minors method for infinite matroids, Gross substitutability: an algorithmic survey, Beyond abstract elementary classes: on the model theory of geometric lattices, Bivariate complexity analysis of \textsc{Almost Forest Deletion}, On the information ratio of non-perfect secret sharing schemes, Cliques in dense GF(\(q\))-representable matroids, Disjoint cocircuits in matroids with large rank, Matroids with many common bases., Unique representability and matroid reconstruction, Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets, Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability, On series-parallel extensions of uniform matroids, On the minor-minimal 3-connected matroids having a fixed minor., Graphs whose positive semi-definite matrices have nullity at most two, The Catalan matroid, Lattice path matroids: Enumerative aspects and Tutte polynomials, Matroids over partial hyperstructures, The class of binary matroids with no \(M\)(\(K_{3,3}\))-, \(M^{*}\)(\(K_{3,3}\))-, \(M\)(\(K_{5}\))- or \(M^{*}\)(\(K_{5}\))-minor., Towards classification of semigraphoids., Cell complexes, oriented matroids and digital geometry., On the powers of a vectorial matroid -- an equivalence relation., Equivalent realisations of a rigid graph, T-uniqueness of some families of \(k\)-chordal matroids, Tutte polynomials of generalized parallel connections, Homogeneous multivariate polynomials with the half-plane property, Complete principal truncations of Dowling lattices, Problems related to type-\(A\) and type-\(B\) matrices of chromatic joins, A linking polynomial of two matroids, Fast approximation of matroid packing and covering, Harder-Narasimhan theory for linear codes (with an appendix on Riemann-Roch theory), Cyclic flats and corners of the linking polynomial, Constant-time local computation algorithms, Independence and totalness of subspaces in phase space methods, On the intersection of infinite matroids, A convolution formula for Tutte polynomials of arithmetic matroids and other combinatorial structures, Möbius coinvariants and bipartite edge-rooted forests, On critical circuits in \(k\)-connected matroids, Galois groups of multivariate Tutte polynomials, The basis graph of a bicolored matroid, Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width, Biased positional games on matroids, Contractible bonds in graphs, Parallel connections and coloured Tutte polynomials, Largest circuits in matroids, Reconstructing ternary Dowling geometries, Connected rigidity matroids and unique realizations of graphs, Polynomials with the half-plane property and the support theorems, On the intersection of independence systems, Matroidal frameworks for topological Tutte polynomials, A circuit axiomatisation of Lagrangian matroids, The base-matroid and inverse combinatorial optimization problems., Characterizing the flow equivalent trees of a network, Algebras related to matroids represented in characteristic zero, Orlik-Solomon algebras and Tutte polynomials, Adjacency, inseparability, and base orderability in matroids, Bicycle dimension and special points of the Tutte polynomial, Stabilizers of classes of representable matroids, Cycle bases for lattices of binary matroids with no Fano dual minor and their one-element extensions, A characterization of the orientations of ternary matroids, Non-separating cocircuits in binary matroids, A short proof of non-GF(5)-representability of matroids, On the minor-minimal 2-connected graphs having a fixed minor, On the structure of 3-connected matroids and graphs, A note on maxflow-mincut and homomorphic equivalence in matroids, Supersolvable frame-matroid and graphic-lift lattices, Splitting in a binary matroid, On coefficients of the Tutte polynomial, On basis-exchange properties for matroids, Edge-disjoint minimum-weight connected spanning \(k\)-edge subgraphs in a weighted graph: A connectedness theorem, On packing minors into connected matroids, On binary \(k\)-paving matroids and Reed-Muller codes, Combinatorial flag varieties, Generalized \(\Delta\text{--}Y\) exchange and \(k\)-regular matroids, The excluded minors for GF(4)-representable matroids, On the excluded minors for quaternary matroids, A generalization of a theorem of Dirac, Matroid 4-connectivity: A deletion-contraction theorem, Totally free expansions of matroids., On the connectivity function of a binary matroid, On matroids of branch-width three., Graph representations of a bicircular matroid, Covering numbers under small perturbations, Anti-matroids, An axiomatic system for affine spaces in terms of points, lines, and planes, Zonotopal algebra and forward exchange matroids, On the activities of \(p\)-basis of matroid perspectives, Bicircular matroids are 3-colorable, Matroid intersection, base packing and base covering for infinite matroids, Coincidence of the sets of minimal and irreducible join graphs over primary structure of algebraic Bayesian networks, Core-based criterion for extreme supermodular functions, Linearly dependent vectorial decomposition of clutters, Lifting matroid divisors on tropical curves, Finitary and cofinitary gammoids, The topology of the external activity complex of a matroid, Algorithms for the partial inverse matroid problem in which weights can only be increased, Graph compositions of suspended \(Y\)-trees, Factorization theorems for strong maps between matroids of arbitrary cardinality, Extended formulations for independence polytopes of regular matroids, Flexibility of projective-planar embeddings, On internally 4-connected non-regular binary matroids, The Brown-Colbourn conjecture on zeros of reliability polynomials is false, Transforms and minors for binary functions, Confinement of matroid representations to subsets of partial fields, Lattice path matroids: the excluded minors, The number of points in a matroid with no \(n\)-point line as a minor, The lattice of integer flows of a regular matroid, On inequivalent representations of matroids over non-prime fields, Lines, circles, planes and spheres, Slider-pinning rigidity: a Maxwell-Laman-type theorem, Distributive lattices, polyhedra, and generalized flows, Balanced and 1-balanced graph constructions, Axioms for infinite matroids, Outerplanar obstructions for matroid pathwidth, Recipe theorem for the Tutte polynomial for matroids, renormalization group-like approach, Dominating circuits in regular matroids, Oriented hypergraphs: introduction and balance, Obstructions to determinantal representability, A base exchange property for regular matroids, Matroids with an infinite circuit-cocircuit intersection, The structure of 4-flowers of vertically 4-connected matroids, Strong splitter theorem, A constructive characterisation of circuits in the simple \((2,2)\)-sparsity matroid, Sign patterns of rational matrices with large rank, From clutters to matroids, Logarithmic tree-numbers for acyclic complexes, Connectedness of refined Goetschel-Voxman fuzzy matroids, Bases axioms and circuits axioms for fuzzifying matroids, \(\Gamma\)-extension of binary matroids, On some Tutte polynomial sequences in the square lattice, Bonds with parity constraints, Cyclic orderings and cyclic arboricity of matroids, Decomposition of 3-connected representable matroids, Stability, fragility, and Rota's conjecture, Decomposition width of matroids, A characterization of uniform matroids, Extending the Torelli map to toroidal compactifications of Siegel space, The nullities for \(M\)-fuzzifying matroids, Matroids with at least two regular elements, Hierarchical zonotopal power ideals, A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs, An Erdős-Gallai theorem for matroids, Ideal multipartite secret sharing schemes, On sets of vectors of a finite vector space in which every subset of basis size is a basis. II, Generating an internally 4-connected binary matroid from another, A proof of Cunningham's conjecture on restricted subgraphs and jump systems, Congruence conditions, parcels, and Tutte polynomials of graphs and matroids, Matroidal approaches to rough sets via closure operators, On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs, Spanning cycles in regular matroids without small cocircuits, On the structure of the \(h\)-vector of a paving matroid, Finite connectivity in infinite matroids, The saga of minimum spanning trees, Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width, An algorithm for weighted fractional matroid matching, Spectral hypergraph theory of the adjacency hypermatrix and matroids, Indicated coloring of matroids, Betti numbers associated to the facet ideal of a matroid, A decomposition theorem for binary matroids with no prism minor, Weak orientability of matroids and polynomial equations, Valuated matroid-based algorithm for submodular welfare problem, Computing the Tutte polynomial of lattice path matroids using determinantal circuits, On the generality of the greedy algorithm for solving matroid base problems, Displaying blocking pairs in signed graphs, Towards a splitter theorem for internally 4-connected binary matroids. VIII: Small matroids., On the \(H\)-force number of Hamiltonian graphs and cycle extendability, The coloring game on matroids, The realizability of curves in a tropical plane, On-line list coloring of matroids, Generalized three-way decision models based on subset evaluation, Positively oriented matroids are realizable, Inclusion of forbidden minors in random representable matroids, The colorful Helly theorem and colorful resolutions of ideals, Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid, Zonotopal algebra, Cellular spanning trees and laplacians of cubical complexes, A proof of the molecular conjecture, Bounded direction-length frameworks, A strong log-concavity property for measures on Boolean algebras, Matroid base polytope decomposition, Restrictions as stabilizers, Monadic second-order model-checking on decomposable matroids, Splines, lattice points, and arithmetic matroids, Stabilizer theorems for even cycle matroids, The complexities of the coefficients of the Tutte polynomial, Coins and cones, Connectivity and \(\beta\)-invariants of isotropic systems and 4-regular graphs, On rounded five-element lines of matroids, Decomposition of the flow polynomial, Splitting formulas for Tutte polynomials, Techniques in matroid reconstruction, Note on inseparability graphs of matroids having exactly one class of orientations, A 2-isomorphism theorem for hypergraphs, A generalization of a graph result of D. W. Hall, A longest cycle version of Tutte's wheels theorem, On exchange properties for Coxeter matroids and oriented matroids, External and internal elements of a matroid basis, On contractible and vertically contractible elements in 3-connected matroids and graphs, On packing 3-connected restrictions into 3-connected matroids, The covering number of the elements of a matroid and generalized matrix functions, Panelling planar graphs, On the matroids in which all hyperplanes are binary, The connectivity of the SEE-graph and AEE-graph for the connected spanning \(k\)-edge subgraphs of a graph, Large circuits in binary matroids of large cogirth. I, Flows, view obstructions, and the lonely runner, A splitter for graphs with no Petersen family minor, Removable circuits in multigraphs, Unavoidable minors of large 3-connected matroids, Inverse maximum capacity problems, On the excluded minors for the matroids of branch-width \(k\), \(g\)-elements of matroid complexes., The linear delta-matroid parity problem, An algorithm to compute the set of characteristics of a system of polynomial equations over the integers., Decomposable multi-parameter matroid optimization problems., Connectivity in frame matroids, Contracting an element from a cocircuit, Some open problems on excluding a uniform matroid, Shellable complexes and topology of diagonal arrangements, A new characterization of graphic matroids, On minimally \(k\)-connected matroids, Ring graphs and complete intersection toric ideals, The projective plane is a stabilizer, The 3-connected matroids with circumference 6, Minors of simplicial complexes, A proof of unimodality on the numbers of connected spanning subgraphs in an \(n\)-vertex graph with at least \(\left\lceil (3-2\sqrt 2) n^2 + n - \frac {7-2\sqrt 2}{2 \sqrt 2}\right\rceil\) edges, A note on totally free matroids, Lifts of matroid representations over partial fields, Matroid polytopes and their volumes, When excluding one matroid prevents infinite antichains, Rigidity, global rigidity, and graph decomposition, On Mighton's characterization of graphic matroids, Circuit and fractional circuit covers of matroids, Categories of bi-fuzzy pre-matroids, Axioms for bases of closed regular fuzzy matroids, Flag enumerations of matroid base polytopes, A combinatorial proof of the Rayleigh formula for graphs, Enumerating bases of self-dual matroids, The box-TDI system associated with 2-edge connected spanning subgraphs, The Erdös-Pósa property for matroid circuits, Growth rates of minor-closed classes of matroids, Ideal secret sharing schemes whose minimal qualified subsets have at most three participants, Blowup algebras of square-free monomial ideals and some links to combinatorial optimization problems, Removing circuits in 3-connected binary matroids, Nowhere-zero 4-flow in almost Petersen-minor free graphs, Packing circuits in matroids, Some extremal connectivity results for matroids, Rigidity of octahedral-tetrahedral trusses, On contracting hyperplane elements from a 3-connected matroid, Weak maps and stabilizers of classes of matroids, Clutters and circuits. II, Matroids on partially ordered sets, Frame cellular automata: Configurations, generating sets and related matroids, On clone sets of \(GF(q)\)-representable matroids, The combinatorics behind number-theoretic sieves, Deletion-contraction to form a polymatroid, On minor-minimally 3-connected binary matroids, Tangles, tree-decompositions and grids in matroids, Persistency and matroid intersection, Measuring and computing natural generators for homology groups, A new approach to the fuzzification of matroids, Some methods for evaluating the optimality of elements in matroids with ill-known weights, A quasisymmetric function for matroids, The 3-connected binary matroids with circumference 6 or 7, Sparse hypergraphs and pebble game algorithms, Ehrhart polynomials of matroid polytopes and polymatroids, Sparsity-certifying graph decompositions, A characterization of jointless Dowling geometries, Ore-type and Dirac-type theorems for matroids, Zero-free regions for multivariate tutte polynomials (alias Potts-model partition functions) of graphs and matroids, Spanning trees and a conjecture of Kontsevich, Counting points on varieties over finite fields related to a conjecture of Kontsevich, Multicolored parallelisms of Hamiltonian cycles, On the representability of totally unimodular matrices on bidirected graphs, On chooser-picker positional games, Internally 4-connected binary matroids with cyclically sequential orderings, Some remarks on Jaeger's dual-hamiltonian conjecture, On the connectivity of random subsets of projective spaces, Triads and triangles in 3-connected matroids, Matroid representations by partitions, On matroids with many common bases, On matroids without a non-Fano minor, On extremal connectivity properties of unavoidable matroids, Schur complements obey Lambek's categorial grammar: Another view of Gaussian elimination and LU decomposition, On the problem of approximating the number of bases of a matroid, Inequivalent representations of matroids having no \(U_{3,6}\)-minor, Linearly independent set families, Fork-decompositions of matroids, The Pascal matroid as a home for generating sets of cellular automata configurations defined by quasigroups, Graphs determined by polynomial invariants, Determinantal probability measures, Recurrence relations for the spectrum polynomial of a matroid, A new face iterator for polyhedra and for more general finite locally branched lattices, On paving matroids and a generalization of MDS codes, Colorability of induced matroids, On graphic elementary lifts of graphic matroids, Bases of certain finite groups, Matroids of combinatorially formal arrangements are not determined by their points and lines, Random packing by matroid bases and triangles, Totally unimodular Leontief directed hypergraphs, Base exchange properties of graphic matroids, Self-dual graphs, Inequivalent representations of ternary matroids, The facets of the spanning trees polytope, Abelian sharing, common informations, and linear rank inequalities, Binary matroids without prisms, prism duals, and cubes, A dual approximation approach to weighted matroid intersection, The connectivity and diameter of second order circuit graphs of matroids, Matroid rank functions and discrete concavity, Foundations for a theory of complex matroids, Polynomial invariants of graphs on surfaces, On the Wilson monoid of a pairwise balanced design, Topological representations of matroid maps, A matroid view of key theorems for edge-swapping algorithms, Some results involving the splitting operation on binary matroids, Splitting lemma for 2-connected graphs, Graph varieties in high dimension, Global rigidity of direction-length frameworks, Tri-partitions and bases of an ordered complex, Acyclic systems of permutations and fine mixed subdivisions of simplices, The Tutte polynomial of some matroids, The diagonal of tropical matroid varieties and cycle intersections, The lattice and matroid representations of definable sets in generalized rough sets based on relations, Valuative invariants for polymatroids, The monoid of monotone functions on a poset and quasi-arithmetic multiplicities for uniform matroids, Arrangements, channel assignments, and associated polynomials, Tropical Kirchhoff's formula and postoptimality in matroid optimization, The complete hierarchical locality of the punctured simplex code, A general separation theorem for various structures, Families of vectors with prescibed rank partition and a prescribed subfamily, Characterizing combinatorial geometries by numerical invariants, Orienting matroids representable over both GF(3) and GF(5), Modified log-Sobolev inequalities for strongly log-concave distributions, Identifiability in phylogenetics using algebraic matroids, Envelopes and clutters, Classification of pointed reflection spaces, Finding temporal paths under waiting time constraints, Compression of \(\mathrm{M}^\natural\)-convex functions -- flag matroids and valuated permutohedra, On the intersection conjecture for infinite trees of matroids, Stanley-Reisner resolution of constant weight linear codes, Higher weight spectra of codes from Veronese threefolds, On the notion of generalized minor in topological network theory and matroids, On the term rank partition, Well-posedness of the permutation problem in sparse filter estimation with \(\ell^p\) minimization, Codes with the rank metric and matroids, Envy freedom and prior-free mechanism design, Betti numbers of multigraded modules of generic type, Extending Brickell-Davenport theorem to non-perfect secret sharing schemes, Power of \(k\) choices and rainbow spanning trees in random graphs, Representations of weakly multiplicative arithmetic matroids are unique, Completion and decomposition of a clutter into representable matroids, Graphic splitting of cographic matroids, Infinite gammoids, Gammoids, pseudomodularity and flatness degree, Commuting birth-and-death processes, Secret sharing schemes based on graphical codes, Complementation, local complementation, and switching in binary matroids, A 2-isomorphism theorem for delta-matroids, Infinite matroids in graphs, Thomas H. Brylawski (1944--2007), Splicing matroids, Unavoidable parallel minors of regular matroids, A Tutte-style proof of Brylawski's tensor product formula, Small cocircuits in matroids, The excluded minors for near-regular matroids, Joins of oriented matroids, Obstructions to a binary matroid being graphic, On the circuit-spectrum of binary matroids, Interpretations of the Tutte and characteristic polynomials of matroids, Representative families for matroid intersections, with applications to location, packing, and covering problems, Optimal matroid partitioning problems, Secret sharing and duality, Initial degenerations of Grassmannians, Graph reconstruction from unlabeled edge lengths, A unifying model for locally constrained spanning tree problems, Matroid optimization problems with monotone monomials in the objective, Interpretations for the Tutte polynomials of morphisms of matroids, The closure operator and flats of \(\Gamma\)-extension matroids, Varieties of tropical ideals are balanced, Fusion rules for pastures and tracts, Rank connectivity and pivot-minors of graphs, Discrete polymatroids, Cycle cover ratio of regular matroids, Matroids over skew tracts, Determination of the bases of a splitting matroid, Topological representations of matroids, Unnamed Item, Positroids and non-crossing partitions, Dressed coherent states in finite quantum systems: A cooperative game theory approach, Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs, Algorithm for constraint partial inverse matroid problem with weight increase forbidden, A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter, Decompositions of signed-graphic matroids, Higher support matroids, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), The multivariate arithmetic Tutte polynomial, Computing Weighted Strength and Applications to Partitioning, Submodular Functions: Learnability, Structure, and Optimization, Matroidal approximations of independence systems, Representations of automorphism groups on the homology of matroids, Trilateral matroids induced by n_3-configurations, Tree robustness of a graph, The circular chromatic number of series-parallel graphs with large girth, Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract), Negative prices in network pricing games, Iso edge domains, On the Ehrhart polynomial of minimal matroids, Tabling with Sound Answer Subsumption, An Introduction to Coding Sequences of Graphs, Hodge theory in combinatorics, Covering Directed Graphs by In-Trees, Transcritical Bifurcation without Parameters in Memristive Circuits, Recent Developments in Discrete Convex Analysis, Some Problems on Approximate Counting in Graphs and Matroids, On the topology of a boolean representable simplicial complex, The lattice of flats of a boolean representable simplicial complex, Polyhedral approaches to learning Bayesian networks, A counterexample to the maximality of toric varieties, A sharp bound on the size of a connected matroid, Harmonic cycles for graphs, An introduction to the k-defect polynomials, Patterns in Khovanov link and chromatic graph homology, Connectedness of Graph and Matroid by Covering-Based Rough Sets, Tropical ideals, The lattice of integral flows and the lattice of integral cuts on a finite graph, Two Decompositions in Topological Combinatorics with Applications to Matroid Complexes, M-FUZZIFYING MATROIDS INDUCED BY M-FUZZIFYING CLOSURE OPERATORS, On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph, Cocycles on tropical varieties via piecewise polynomials, Witt rings and matroids, Algebraic Geometry and Finite Frames, Noether normalizations, reductions of ideals, and matroids, Degenerations of cubic threefolds and matroids, Combinatorics and geometry of power ideals, Unnamed Item, Unnamed Item, On decomposing a graph into nontrivial bonds, The Internally 4-Connected Binary Matroids With No 𝑀(𝐾_{3,3})-Minor., Circuit and cocircuit partitions of binary matroids, Complexity and algorithms for computing Voronoi cells of lattices, On removable circuits in graphs and matroids, On the structure of spikes, Expansion and contraction functors on matriods, On extension of graphic matroids, The cobases of the element splitting and the es-splitting matroids, Limitations of randomized mechanisms for combinatorial auctions, Projective geometries in dense matroids, Representable orientations of the free spikes, Totally free arrangements of hyperplanes, Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits, Unavoidable Connected Matroids Retaining a Specified Minor, Robust Auctions for Revenue via Enhanced Competition, Minimum Cycle Bases and Their Applications, Unnamed Item, On the Complexity of Matroid Isomorphism Problems, Ideal Hierarchical Secret Sharing Schemes, On the basis graph of a bicolored matroid, Spanning and independence properties of frame partitions, A Tutte polynomial for toric arrangements, Rank-width and vertex-minors, On cohomology algebras of complex subspace arrangements, The free product of matroids, Families of matroids induced by classes of graphs, The magnitude of a graph, On partitioning two matroids into common independent subsets, A note on some inequalities for the Tutte polynomial of a matroid, A note on the Rees algebra of a bipartite graph, The structure of equivalent 3-separations in a 3-connected matroid, On matroids determined by their Tutte polynomials, The chip-firing game, Transition polynomials, Recent work in matroid representation theory, A unique factorization theorem for matroids, Maps of matroids with applications, Extensions of the critical theorem, On pancyclic representable matroids, Distribution of contractible elements in 2-connected matroids, The Bergman complex of a matroid and phylogenetic trees, A Tutte decomposition for matrices and bimatroids, Matroid packing and covering with circuits through an element, On cographic matroids and signed-graphic matroids, A particular class of graphic matroids, Expected value of the minimal basis of random matroid and distributions of q-analogs of order statistics, Two disjoint negative cycles in a signed graph, Ring graphs and toric ideals, The recoverable robust spanning tree problem with interval costs is polynomially solvable, Internally perfect matroids, Polyhedral aspects of score equivalence in Bayesian network structure learning, About a new class of matroid-inducing packing families, A characterization of graphic matroids using non-separating cocircuits, Matroid representation of clique complexes, Least and most colored bases, A general graphical procedure for finding motion centers of planar mechanisms, Flag arrangements and triangulations of products of simplices, Cyclotomic and simplicial matroids, Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids, Biased graphs. VII: Contrabalance and antivoltages, Cycles in circuit graphs of matroids, Objective functions with redundant domains, Parameterized counting of trees, forests and matroid bases, Minors in graphs of large \(\theta_r\)-girth, Discrete polymatroids satisfying a stronger symmetric exchange property, Connectedness of graphs and its application to connected matroids through covering-based rough sets, Rank-width: algorithmic and structural results, Reconstruction of infinite matroids from their 3-connected minors, Modularity and greed in double auctions, Clones in matroids representable over a prime field, On the subsemigroup complex of an aperiodic Brandt semigroup, Regularity of symbolic powers and arboricity of matroids, Agreeable sets with matroidal constraints, Odd and even cycles in maker-breaker games, Hamilton cycles in circuit graphs of matroids, Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices, A weighted independent even factor algorithm, Group connectivity and group colorings of graphs --- a survey, Balanced matrices, The entropic discriminant, The Deodhar decomposition of the Grassmannian and the regularity of KP solitons, Constructing rate \(1/p\) systematic binary quasi-cyclic codes based on the matroid theory, Matroid base polytope decomposition II: Sequences of hyperplane splits, A remark on hierarchical threshold secret sharing, Branch decomposition heuristics for linear matroids, On a base exchange game on bispanning graphs, On the toric ideal of a matroid, Adhesivity of polymatroids, Polynomials with the half-plane property and matroid theory, Pairs of largest circuits in 3-connected matroids, A modular triple characterization of circuit signatures, Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors, On the (co)girth of a connected matroid, A note on binary matroid with no \(M(K_{3,3})\)-minor, Optimization with binet matrices, On deletions of largest bonds in graphs, Orbit-counting polynomials for graphs and codes, Pebble game algorithms and sparse graphs, Matroid automorphisms of the root system \(H_{3}\), The max-flow min-cut property of two-dimensional affine convex geometries, Wild triangles in 3-connected matroids, Matroids with nine elements, Non-separating cocircuits in matroids, A chain theorem for matroids, Sieve methods in combinatorics, Lattice path matroids: structural properties, Matroids with few non-common bases, Branch-width, parse trees, and monadic second-order logic for matroids., On Rota's conjecture and excluded minors containing large projective geometries., On the colored Tutte polynomial of a graph of bounded treewidth, On some properties of base-matroids, Lindström's conjecture on a class of algebraically non-representable matroids, Rigid two-dimensional frameworks with three collinear points, Weight distribution of the bases of a matroid, Minimal blocks of binary even-weight vectors, Extending a matroid by a cocircuit, Equivalence-free exhaustive generation of matroid representations, Approximating clique-width and branch-width, Obstructions to branch-decomposition of matroids, Bias matroids with unique graphical representations, On the asymptotic proportion of connected matroids, The excluded minors for the class of matroids that are binary or ternary, On the 2-sum in rigidity matroids, A note on clone sets in representable matroids, On the unique representability of spikes over prime fields, A graph-theoretical classification for reflectable bases, On powers of Plücker coordinates and representability of arithmetic matroids, Derivation modules of orthogonal duals of hyperplane arrangements, A note on interconnecting matchings in graphs, Linear codes over signed graphs, Three-way fuzzy matroids and granular computing, Tropical schemes, tropical cycles, and valuated matroids, Compatible cycles and CHY integrals, Weighted quasisymmetric enumerator for generalized permutohedra, Level property of ordinary and symbolic powers of Stanley-Reisner ideals, The structures and the connections on four types of covering rough sets, Approximation via a double-matroid structure, Biased graphs. VI: Synthetic geometry, Relative profiles and extended weight polynomials of almost affine codes, On \(n\)-connected splitting matroids, Efficient explicit constructions of compartmented secret sharing schemes, Interpretations of the Tutte polynomials of regular matroids, Approximate tradeoffs on weighted labeled matroids, Worst case compromises in matroids with applications to the allocation of indivisible goods, Lexicographic shellability, matroids, and pure order ideals, Revenue maximization with a single sample, List coloring of matroids and base exchange properties, Cuts and flows of cell complexes, Degrees of M-fuzzy families of independent L-fuzzy sets, A tight relation between series-parallel graphs and bipartite distance hereditary graphs, Small Cocircuits in Minimally Vertically 4-Connected Matroids, Extremal Khovanov homology and the girth of a knot, Determining the minimum rank of matroids whose basis graph is common, On n-connected minors of the es-splitting binary matroids, Unnamed Item, A Framework for the Secretary Problem on the Intersection of Matroids, Globally rigid graphs are fully reconstructible, Unnamed Item, The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements, Exchange Properties of Finite Set-Systems, Approximation and decomposition in lattices of clutters, Harmonic Tutte polynomials of matroids, Matroid configurations and symbolic powers of their ideals, Hopf Monoids and Generalized Permutahedra, On the structure of matroids arising from the gain graphs, On the revealed preference analysis of stable aggregate matchings, Weighted Tutte-Grothendieck polynomials of graphs, From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals, On the matroidal path ideals, Universal complexes in toric topology, Oriented cobicircular matroids are \textit{GSP}, Lattice of integer flows and the poset of strongly connected orientations for regular matroids, Multistage \(s-t\) path: confronting similarity with dissimilarity, Essential dimension of semisimple groups of type \(B\), The Grassmannian of 3-planes in \(\mathbb{C}^8\) is schön, Bipartite secret sharing and staircases, Biobjective optimization problems on matroids with binary costs, Combinatorial and geometric approaches to counting problems on linear matroids, graphic arrangements, and partial orders, Ear‐decompositions, minimally connected matroids and rigid graphs, Unnamed Item, One-to-one correspondence between interpretations of the Tutte polynomials, Hamming polynomial of a demimatroid, On matroids from self-orthogonal codes and their properties, Ideal uniform multipartite secret sharing schemes, Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\), Count and cofactor matroids of highly connected graphs, Cycle algebras and polytopes of matroids, Combinatorial geometry takes the lead, Diverse collections in matroids and graphs, Critical problem for a \(q\)-analogue of polymatroids, Optimally approximating exponential families, On Matroids Representable over 𝐺𝐹(3) and Other Fields, On endomorphisms of arrangement complements, The “Art of Trellis Decoding” Is NP-Hard, When Are Welfare Guarantees Robust, A CHARACTERIZATION OF MATROIDS IN TERMS OF SURFACES, Finding Temporal Paths Under Waiting Time Constraints., Connected hyperplanes in binary matroids, Unnamed Item, The computational complexity of antimatroid properties, On circuit valuation of matroids, Connected hyperplanes in binary matroids, On matroid connectivity, The Projective Planarity Question for Matroids of $3$-Nets and Biased Graphs, The combinatorial Laplacian of the Tutte complex, Base-sortable matroids and Koszulness of semigroup rings, Unnamed Item, A new presentation for the inner Tutte group of a matroid, On the covering number of a matroid element, Matroids Can Be Far from Ideal Secret Sharing, Symbolic powers and matroids, Parallel connections and bundles of arrangements, The axiomatization of randomness, On the geometry of real or complex supersolvable line arrangements, The closure of a linear space in a product of lines, A new proof for a result of Kingan and Lemos', A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid, On the complexity of finding internally vertex-disjoint long directed paths, When are multidegrees positive?, A short proof of a min–max relation for the bases packing of a matroid, The Finite Matroid-Based Valuation Conjecture is False, Unnamed Item, Unnamed Item, Finiteness theorems for matroid complexes with prescribed topology, Approximation Limitations of Pure Dynamic Programming, Bounds of characteristic polynomials of regular matroids, Truncated boolean representable simplicial complexes, Generalized Elko theory, A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, The Closure Operator of es-Splitting Matroids, Efficient Black-Box Reductions for Separable Cost Sharing, Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices, Contribution of Frantisek Matus to the research on conditional independence, One-adhesive polymatroids, Unnamed Item, Unnamed Item, Globally Linked Pairs of Vertices in Rigid Frameworks, The Dehn–Sommerville relations and the Catalan matroid
