Publication:4111952
From MaRDI portal
zbMath0343.05002MaRDI QIDQ4111952
Publication date: 1976
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
05B35: Combinatorial aspects of matroids and geometric lattices
05-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics
Related Items
Nowhere zero flow and circuit covering in regular matroids, Connectivity in bicircular matroids, On theories of Whitney and Tutte, A characterization of the ternary matroids with no \(M(K_ 4)\)-minor, First-order theories of abstract dependence relations, Algebraic characteristic sets of matroids, Directed switching games on graphs and matroids, On determination of graph G whose bond lattice \({\mathcal L}(G)\) is modular, Matroidal games, Upper bounds for the cardinality of s-distances codes, On Tutte polynomials and cycles of plane graphs, On the decomposition of vector spaces, On the cycle polytope of a binary matroid, The 2-quasi-greedy algorithm for cardinality constrained matroid bases, Two results about points, lines and planes, Minors of 3-connected matroids, A nonlinear algebraic matroid with infinite characteristic set, Exchange properties of combinatorial closure spaces, A Mazur-Orlicz type theorem for submodular set functions, A class of graphs containing the polar spaces, Semi-duality and the cycle double cover conjecture, A decomposition theory for matroids. III. Decomposition conditions, Triples in matroid circuits, On chains of 3-connected matroids, Some combinatorial properties of discriminants in metric vector spaces, Nowhere-zero integral chains and flows in bidirected graphs, Independence spaces and uniform modules, Independence structures on the submodules of a module, Matroid Steiner problems, the Tutte polynomial and network reliability, Decomposition and optimization over cycles in binary matroids, On-line updating of solutions to a class of matroid intersection problems, Combinatorial geometries, convex polyhedra, and Schubert cells, On ternary transversal matroids, Polarity and point extensions in oriented matroids, Dowling group geometries and the critical problem, On the independence numbers of a matroid, An extension of Lindström's result about characteristic sets of matroids, Adjacency in binary matroids, Extension equivalence of oriented matroids, Note sur la notion d'équivalence entre deux codes linéaires, Clutters and semimatroids, Clutters and atomistic lattices, Homotopy base of acyclic graphs - a combinatorial analysis of commutative diagrams by means of preordered matroid, Matroid erection and duality, Isotropic systems, A lower bound on connectivities of matroid base graphs, Quotients of Dilworth truncations, A construction for binary matroids, A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids, The long-line graph of a combinatorial geometry. II: Geometries representable over two fields of different characteristics, An infinite family of minor-minimal nonrealizable 3-chirotopes, Recognizing max-flow min-cut path matrices, A characterization of undirected branching greedoids, Symmetry and positive definiteness in oriented matroids, Alternating Whitney sums and matchings in trees. 1, The complexity of parallel search, On harmonic conjugates in full algebraic combinatorial geometries, On binary paving matroids, On binary reducibility, Adjoints of binary matroids, On matroids induced by packing subgraphs, Pseudomatroids, Chordal characterization of graphic matroids, Duality theory for finite and infinite matroids with coefficients, On attainable distribution and classification vectors, A solution of the misère Shannon switching game, The incidence structure of subspaces with well-scaled frames, Ordering of the elements of a matroid such that its consecutive w elements are independent, A characterization of a class of non-binary matroids, A circuit set characterization of antimatroids, On matroids which have precisely one basis in common, Basis pair graphs of transversal matroids are connected, A short proof of a theorem of Vámos on matroid representations, The biased graphs whose matroids are binary, Characterizations of finitary and cofinitary binary matroids, Turán's triangle theorem and binary matroids, On 3-connected matroids, A characterization of matroidal systems of inequalities, An application of submodular flows, On the connectivity function of a matroid, On the fundamental group of 3-gems and a `planar' class of 3-manifolds, Functions computed by monotone Boolean formulas with no repeated variables, A note on Nagami's polynomial invariants for graphs, A short proof of Tutte's characterization of totally unimodular matrices, Combinatorial dynamical system theory: General framework and controllability criteria, On Tutte polynomials of matroids representable over \(GF(q)\), On the matroids in which all hyperplanes are binary, The planar multiterminal cut problem, Interval matroids and graphs, Algebraic flows in regular matroids, Infinite subgraphs as matroid circuits, On a covering problem of Mullin and Stanton for binary matroids, The greedy algorithm for partially ordered sets, A class of rank-invariants for perfect matroid designs, Determining homomorphisms to skew fields, Matroids and Sperner's lemma, Decomposition of regular matroids, Matroid representation over GF(3), Several identities for the characteristic polynomial of a combinatorial geometry, On projective and affine hyperplanes, Biased graphs whose matroids are special binary matroids, On an excluded-minor class of matroids, Algebraic relations between matroids connected by weak homomorphisms, Grassmann-Plücker relations and matroids with coefficients, Algebras related to matroids represented in characteristic zero, Extending a combinatorial geometry by adding a unique line, The Tutte polynomial of a ported matroid, A decomposition of the matroids with the max-flow min-cut property, Some recent results in combinatorial approaches to dynamical systems, A compactness theorem for perfect matchings in matroids, On the cover time of random walks on graphs, On circuit exchange properties for matroids, On totally dual integral systems, Master polytopes for cycles of binary matroids, Geometric algebra for combinatorial geometries, A multiply constrained matroid optimization problem, On a matroid identity, On the efficiency of representability tests for matroids, A factorization theorem for comaps of geometric lattices, On the points-lines-planes conjecture, Density and dimension, Oriented matroids and multiply ordered sets, The directions determined by n points in the plane: A matroidal generalization, Duality principles for binary matroids and graphs, Properties of matroids characterizable in terms of excluded matroids, Extension of M-convexity and L-convexity to polyhedral convex functions, Finding all common bases in two matroids, Polynomial invariants of graphs with state models, Discrete polymatroids, On greedy bases packing in matroids, Join-semidistributive lattices and convex geometries., Determination of the bases of a splitting matroid, Rigidity percolation and boundary conditions., Additive similarity measures, The \(k\)-fractal of a simplicial complex, \(H\)-lifts of tangential \(k\)-blocks, Generating cycle spaces for graphs on surfaces with small genera, Determinantal probability measures, Recurrence relations for the spectrum polynomial of a matroid, A rounding technique for the polymatroid membership problem, Maurer's homotopy theory for even \(\Delta\)-matroids and related combinatorial geometries, On paving matroids and a generalization of MDS codes, Colorability of induced matroids, The \(r\)-depth of a matroid, The depiction of linear association by matroids, A unified approach to polynomially solvable cases of integer ``non-separable quadratic optimization, Identifying restrictions of linear equations with applications to simultaneous equations and cointegration, Chromatic invariants for finite graphs: Theme and polynomial variations, Compositions for matroids with the Fulkerson property, Every matroid is a submatroid of a uniformly dense matroid, Matroid optimization with generalized constraints, Supereulerian graphs and excluded induced minors, On the quasi-transversals of a matroid, Totally unimodular Leontief directed hypergraphs, Non-Stanley bounds for network reliability, Circuit separation for symmetric matroids, Generalizing the all-pairs min cut problem, Pfaffian forms and \(\Delta\)-matroids with coefficients, Base exchange properties of graphic matroids, Polynomial invariants of graphs. II, Constrained matroidal bottleneck problems, Reverse search for enumeration, Binary matroids without prisms, prism duals, and cubes, Ordered matroids and regular independence systems, Realization of rank 3 matroids, Arrangements, channel assignments, and associated polynomials, Families of vectors with prescibed rank partition and a prescribed subfamily, Oriented rank three matroids and projective planes, Partial matroid representations, Polymatroid greedoids, On combinatorial structures of line drawings of polyhedra, Matroidal bijections between graphs, Combinatorial construction of logarithmic differential forms, Acyclic modular lattices and their representations, A generalized cut-condition for multiflows in matroids, Generalization of Barahona's algorithm for cases of integer non-linear programming with box constraints, Recognizing a class of bicircular matroids, Characteristic polynomials, Ehrhart quasi-polynomials, and torus groups., Lattice path matroids: structural properties, The characterization of sufficient visibility in the direct reference plane approach for multiple views with missing data, A new formula for an evaluation of the Tutte polynomial of a matroid, On partitioning two matroids into common independent subsets, Graph polynomials derived from Tutte-Martin polynomials, The chip-firing game, A unique factorization theorem for matroids, Maps of matroids with applications, Dependences related to strict binary relations, Extensions of the critical theorem, On pancyclic representable matroids, The mathematical foundations of bond graphs. II: Duality, The mathematical foundations of bond graphs. III: Matroid theory, The mathematical foundations of bond graphs. IV: Matrix representations and causality, Higher support matroids, Constructing division rings as module-theoretic direct limits, A Matroid Abstraction of the Bott–Duffin Constrained Inverse, Geometria combinatoria e geometrie finite, Triangulations of Oriented Matroids and Convex Polytopes, Greedoids and Linear Objective Functions, On Some Problems in the Design of Plane Skeletal Structures, Boolean Methods of Optimization over Independence Systems, A note on some algorithms for matroids, Some matroid inequalities, Packing and covering with matroid circuits, Local complementation and interlacement graphs, Network theory and transversal matroids, The Redei function of a relation, Fundamental circuits and a characterization of binary matroids, Sur l'évaluation \(t(M;2,0)\) du polynôme de Tutte d'un matroide et une conjecture de B. Grünbaum rélative aux arrangements de droites du plan, Representation over a field of full simplicial matroids, A unique exchange property for bases, On products of matroids, Intersection theory for graphs, A note on half-planar geometries, The broken-circuit complex: its structure and factorizations, Distance matrices and \(n\)-dimensional designs, Vector transversals, A quantifier for matroid duality, On characterizations of binary and graphic matroids, A characterization of binary geometries by a double elimination axiom, Les systèmes triples de Hall de dimension 4, Homotopy type and Euler characteristic of partially ordered sets, The independent sets of rank k of a matroid, A constructive approach to the critical problem for matroids, Signed graphs, Alpha-balanced graphs and matrices and GF(3)-representability of matroids, A simple approach to some basic results in matroid theory, On the sum of matroids. III, Matroids and multicommodity flows, Minimum numbers of circuits in affine sets, Two combinatorial applications of the Aleksandrov-Fenchel inequalities, Decomposition of group flows in regular matroids, Hyperplane reconstruction of the Tutte polynomial of a geometric lattice, On the enumeration of chains in regular chain-groups, Matroids on the bases of simple matroids, Separating cocircuits in binary matroids, A note on sticky matroids, Tangential 1-blocks over GF(3), Die Jaboci-Abbildung über dem Raum der Mumfordkurven, A simple theorem on 3-connectivity, Sur les matroides orientes de rang 3 et les arrangements de pseudodroites dans le plan projectif réel, Duality of infinite graphs, Factorization properties for isometries of matroids into projective spaces, Construction of matroidal families by partly closed sets, Descriptively sufficient subcollections of flats in matroids, \(k\)-elimination property for circuits of matroids, Biased graphs. II: The three matroids, Broken circuit complexes: Factorizations and generalizations, Algebraic varieties characterizing matroids and oriented matroids, Another proof of a theorem concerning detachments of graphs, A note on the non-spanning circuits of a matroid, Projective equivalence of matroids with coefficients, Clutters and matroids, Elementary divisors of graphs and matroids, Two packing problems on \(k\)-matroid trees, Supersolvable and modularly complemented matroid extensions, On matroids and hierarchical graphs, Triangles in 3-connected matroids, Ternary paving matroids, Being Hamiltonian is not a Tutte invariant, Graph minors. X: Obstructions to tree-decomposition, On the classification of ideal secret sharing schemes, On minors avoiding elements in matroids, A note on roundedness in 4-connected matroids, On the two-dimensional generic rigidity matroid and its dual, Multicolored forests in bipartite decompositions of graphs, Forests, frames, and games: Algorithms for matroid sums and applications, A short proof that matching matroids are transversal, Perfect matroids, Valuated matroids, Integer programs for logic constraint satisfaction, Unimodular equivalence of graphs, A minimal 3-connectedness result for matroids, The notion and basic properties of \(M\)-transversals, Paroids: A canonical format for combinatorial optimization, Connectivity of submodular functions, Dilworth truncations and \(k\)-induced matroids, Cycle lengths and circuit matroids of graphs, Invertibility of the base Radon transform of a matroid, Extensions of Tutte's wheels-and-whirls theorem, A note on the \(f\)-factor-lattice of bipartite graphs, The complexity of finding arborescences in hypergraphs, Duality in graph families, Fractional arboricity, strength, and principal partitions in graphs and matroids, Recognizing hidden bicircular networks, Cover preserving embedding of modular lattices into partition lattices, The matroids with the max-flow min-cut property, Matroids from directed graphs, On cographic regular matroids, Vector representable matroids of given rank with given automorphism group, Bimatroids and invariants, An extension of Tutte's 1-factor theorem, On Hartfiel and Maxson's definition of connected sets of a matroid, On matroidal families, Non-regular simplicial matroids, Geometries simpliciales unimodulaires, Some extremal connectivity results for matroids, Note on a matroid with parity condition, An abstract duality, A characterization of certain excluded-minor classes of matroids, On infinite Goldie dimension, Rigidity and the lower bound theorem. I, The regular matroids with no 5-wheel minor, On the complexity of embedding planar graphs to minimize certain distance measures, Reconstruction of the orientation class of an oriented matroid, The polytope of degree sequences, A unifying approach to descriptive geometry and mechanisms, On the numbers of bases and circuits in simple binary matroids, On some extremal connectivity results for graphs and matroids, On the critical exponent of transversal matroids, Matroids and linking systems, Clutters and circuits, Bond graphs. III: Bond graphs and electrical networks, Reliable assignments of processors to tasks and factoring on matroids, Poset matching---a distributive analog of independent matching, Stable sets versus independent sets, Tutte polynomials computable in polynomial time, On the higher-order edge toughness of a graph, Coordinatization of B-matroids, Planar graphs with no 6-wheel minor, A path-following procedure to find a proper equilibrium of finite games, Monotone clutters, Pseudo-Boolean optimization, On sign-invariance graphs of uniform oriented matroids, p-independence implies pseudomodularity, On a packing problem for infinite graphs and independence spaces, Matroids and antimatroids - a survey, A geometric characterization of Dowling lattices, A group-theoretic interpretation of Tutte's homotopy theory, Odd path packings, On the unimodality of the independent set numbers of a class of matroids, A note on the separation problem for the matching matroid, A vector exchange property of submodular systems, Canonical decompositions of symmetric submodular systems, Matroids over \(F_ p\) which are rational excluded minors, The convex weighting of a graph and an alternative definition of a matroid, Recent trends in combinatorial optimization, Note on binary simplicial matroids, Sur la compatibilité des extensions ponctuelles d'un matroïde, Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem, Rank functions of closure spaces of finite rank, On binary identically self-dual matroids, Optimal matchings in posets, A network theory approach to the rigidity of skeletal structures. I: Modelling and interconnection, Extensions of combinatorial geometries by the addition of a unique line, On the number of common bases of two matroids, A note on the critical problem for matroids, A geometric approach to forbidden minors for GF(3), Graphes de cordes et espaces graphiques, Generalized chromatic polynomials, On singleton 1-rounded sets of matroids, Hamiltonicity in (0-1)-polyhedra, The matroidal knapsack: A class of (often) well-solvable problems, An algebraic and combinatorial approach to the analysis of line drawings of polyhedra, On D-complementation, On minor-minimally-connected matroids, Some combinatorial and algebraic properties of Coxeter complexes and Tits buildings, A generalization to bases common to r binary matroids of the weighted matrix-tree theorem in the case when the weights are Boolean, A note on nongraphic matroids, A characterization of matroidal families of multigraphs, A decomposition theory for matroids. I: General results, A characterization of circle graphs, Injection geometries, On adjoints and dual matroids, A unifying approach to the structures of the stable matching problems, Efficient algorithms for robustness in resource allocation and scheduling problems, On finite matroids with two more hyperplanes than points, Representations of matroids and free resolutions for multigraded modules, Defining matroids through sequential selection, Extreme point axioms for closure spaces, Linear spaces, transversal polymatroids and ASL domains, Enumerating disjunctions and conjunctions of paths and cuts in reliability theory, Closure axioms for a class of fuzzy matroids and co-towers of matroids, Matroids on convex geometries (cg-matroids), Combinatorial geometries representable over GF(3) and GF(q). I: The number of points, The structure of bases in bicircular matroids, Matroidizing set systems: A new approach to matroid theory, Extensions of line-closed combinatorial geometries, Combinatorial geometries representable over GF(3) and GF(q). II: Dowling geometries, Notes on dimensional closure spaces, k-sum optimization problems, Decomposition of partial orders, On multivariate E-splines, Matchings and \(\Delta\)-matroids, Bivalent trees and forests or upper bounds for the probability of a union revisited, Balanced sets in an independence structure induced by a submodular function, On a characterization of Dilworth truncations of combinatorial geometries, Unions of oriented matroids, Arbres minimaux d'un graphe preordonne, Nowhere-zero integral flows on a bidirected graph, A class of matroids derived from saturated chain partitions of partially ordered sets, On matroids of the greatest W-connectivity, Rigidity of multi-graphs. I: Linking rigid bodies in n-space, Testing membership in matroid polyhedra, On the complexity of recognizing a class of generalized networks, Detection of structural inconsistency in systems of equations with degrees of freedom and its applications, Polarity and inner products in oriented matroids, Boolean techniques for matroidal decomposition of independence systems and applications to graphs, Modularity in tangential k-blocks, An Erdős-Gallai conjecture, Circuit preserving edge maps. II, A unified approximation algorithm for node-deletion problems, Clutters and circuits. II, Matroids on partially ordered sets, On packing connectors, Approximations for the disjoint paths problem in high-diameter planar networks, Linear programs for constraint satisfaction problems, A three-dimensional matching model for perishable production scheduling, A homological approach to two problems on finite sets, Discrete convex analysis, Two-best solutions under distance constraints: The model and exemplary results for matroids, On the connectivity of random subsets of projective spaces, Test sets of integer programs, Matroid representations by partitions, Multimatroids. IV: Chain-group representations, Uncovering generalized-network structure in matrices, Communication complexity and combinatorial lattice theory, On fuzzification of matroids, The computational complexity of knot and matroid polynomials, On the average rank of an element in a filter of the partition lattice, Geometric secret sharing schemes and their duals, On the problem of approximating the number of bases of a matroid, \(k\)-arcs and dual \(k\)-arcs, Simple vertices of maximal minor polytopes, Classifications of finite highly transitive dimensional linear spaces, Hamiltonicity of a type of interchange graphs, Unimodular congruence of the Laplacian matrix of a graph, Basis-transitive matroids, Matroids having the same connectivity function, On combined minmax-minsum optimization, Matroids with coefficients over projective planes, Compatible systems of representatives, Extendable shellability for rank 3 matroid complexes, On the special properties of graphic and co-graphic bondgraphs, On the equivalence of constrained and unconstrained flows, Determining finite graphs by their large Whitney levels, Stochastic independence, algebraic independence and abstract connectedness, \(k\)-connectivity and decomposition of graphs into forests, On edge semi-isomorphisms and semi-dualities of graphs, Matroid tree graphs and interpolation theorems, Algebraic graph theory without orientation, On minimum and maximum spanning trees of linearly moving points, On the number of 3-edge colorings of cubic graphs, On extending closure systems to matroids, Connectivity and \(\beta\)-invariants of isotropic systems and 4-regular graphs, On projective embeddings of partial planes and rank-three matroids, Counting maximal cycles in binary matroids, Decomposition of the flow polynomial, Note on inseparability graphs of matroids having exactly one class of orientations, The \(k\)-cardinality assignment problem, Optimal packing of induced stars in a graph, Lê numbers of arrangements and matroid identities, Two chromatic polynomial conjectures, On exchange properties for Coxeter matroids and oriented matroids, Incidence matrices, geometrical bases, combinatorial prebases and matroids, The delta-sum of matching delta-matroids, A bound for the symmetric travelling salesman problem through matroid formulation, The linear delta-matroid parity problem, An algorithm to compute the set of characteristics of a system of polynomial equations over the integers., Hamiltonian double Latin squares, An inequality for polymatroid functions and its applications., Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability, On series-parallel extensions of uniform matroids, Hereditary systems and greedy-type algorithms., The Catalan matroid, On the complexity of graph tree partition problems., On the extension of a partial metric to a tree metric, Towards classification of semigraphoids., The Go polynomials of a graph., On the powers of a vectorial matroid -- an equivalence relation., The Tutte polynomial of a morphism of matroids. III: Vectorial matroids, Some results on generalised Whitney functions, Lexicographic balanced optimization problems, Inequalities for Shannon entropy and Kolmogorov complexity, Applications of matroid partition to tree decomposition, Adjacency, inseparability, and base orderability in matroids, An algorithm for packing connectors, Cycle bases for lattices of binary matroids with no Fano dual minor and their one-element extensions, The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids, Splitting in a binary matroid, Interpolation theorems for graphs, hypergraphs and matroids, Intersecting set systems and graphic matroids, Chromatic polynomials and order ideals of monomials, On binary \(k\)-paving matroids and Reed-Muller codes, Combinatorial flag varieties, The lattice of \(N\)-run orthogonal arrays, Covering numbers under small perturbations, Factorization theorem for strong maps, Polynomials with real zeros and Pólya frequency sequences, Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width, Biased positional games on matroids, Topological properties of activity orders for matroid bases, Polynomials with the half-plane property and the support theorems, Weight distribution of the bases of a binary matroid, On the generic rigidity of bar-frameworks, Almost flat line configurations, A circuit axiomatisation of Lagrangian matroids, Bouquets of geometric lattices: Some algebraic and topological aspects, Note on the gammoids arising from undirected graphs, The smallest rounded sets of binary matroids, Eigensets and power products of a bimatroid, Varieties of Topological Geometries, Two Decompositions in Topological Combinatorics with Applications to Matroid Complexes, Graphs with the Circuit Cover Property, Interpolation theorems for a family of spanning subgraphs, Bimatroidal independence systems, Latroids and their representation by codes over modules, A Generalisation of the Matroid Lift Construction, A characterization of network representable polymatroids, Multicolored trees in complete graphs, On a classification of independence systems, On matroid connectivity, The computational complexity of antimatroid properties, On circuit valuation of matroids, Representations of matroids in semimodular lattices, On the covering number of a matroid element, Rigidity of multi-story buildings, Tree decomposition, A combinatorial search problem on matroids, Bounding the number of bases of a matroid, Unnamed Item, Extensions of functions of 0-1 variables and applications to combinatorial optimization, A new exchange property for matroids and its application to max-min-problems, Unlabelled Partition Systems: Optimization and Complexity, The intersection of a matroid and a simplicial complex, Expected value of the minimal basis of random matroid and distributions of q-analogs of order statistics, Matroid Representations and free Arrangements, Bases of supermaximal subspaces and Steinitz systems. I, Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—, Strict matching matroids and matroid algorithms, The Null Space Problem I. Complexity, Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations, Iterated parallel union of matroids, Topological conditions for the unique solvability of linear time-invariant and time-varying networks, Extremal Length and Width of Blocking Polyhedra, Kirchhoff Spaces and Multiport Networks, Growth Rates and Critical Exponents of Classes of Binary Combinatorial Geometries, The Number of Solutions to Linear Diophantine Equations and Multivariate Splines, Matroids Determine the Embeddability of Graphs in Surfaces, Tutte Polynomials and Bicycle Dimension of Ternary Matroids, A Combinatorial Proof of the All Minors Matrix Tree Theorem, Whitney Connectivity of Matroids, Single Commodity Representation of Multicommodity Networks, Unnamed Item, On Connectivity in Matroids and Graphs, Varieties of Combinatorial Geometries, Binary Supersolvable Matroids and Modular Constructions, Central Limit Theorems for Sums of Wick Products of Stationary Sequences, Expansions of Chromatic Polynomials and Log-Concavity
