Lectures on matroids
From MaRDI portal
Publication:5530480
DOI10.6028/jres.069B.001zbMath0151.33801OpenAlexW2324166574WikidataQ29041691 ScholiaQ29041691MaRDI QIDQ5530480
Publication date: 1965
Published in: Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.6028/jres.069b.001
Related Items
Volation of port conditions in the interconnection of multiports, Matroids having the same connectivity function, Dependence systems with the operator-image exchange property, Peripheral circuits in infinite binary matroids, Binary group and Chinese postman polyhedra, A characterization of graphic matroids using non-separating cocircuits, Maurer's homotopy theory for even \(\Delta\)-matroids and related combinatorial geometries, Recognizing binet matrices, Connectivity and \(\beta\)-invariants of isotropic systems and 4-regular graphs, Higher support matroids, Totally unimodular Leontief directed hypergraphs, Orientations of chain groups, Circuit separation for symmetric matroids, Generalized bijective maps between \(G\)-parking functions, spanning trees, and the Tutte polynomial, Pfaffian forms and \(\Delta\)-matroids with coefficients, A generalization of Tutte's characterization of totally unimodular matrices, Graphical functions in parametric space, General geometric lattices and projective geometry of modules, Minimum spanning tree cycle intersection problem, On the minimum hybrid rank of a graph relative to a partition of its edges and its application to electrical network analysis, Signed-graphic matroids with all-graphic cocircuits, Bipartite and Eulerian minors, The energy of a simplicial complex, The connectivity and diameter of second order circuit graphs of matroids, Group parking permit problems, \(l\)-matrices and a characterization of binary matroids, Extremal critically connected matroids, Topological transformations of electrical networks, Improved bounds for the greedy strategy in optimization problems with curvature, Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices, Matroids with many common bases., Dual row modules and polyhedra of blocking group problems, An upper bound for the circumference of a 3-connected binary matroid, Hepp's bound for Feynman graphs and matroids, Structural properties and recognition of restricted and strongly unimodular matrices, Matroids—the Engineers’ Revenge, Higher dimensional electrical circuits, Biased graphs IV: Geometrical realizations, On a generalization of the matroid, The Tutte polynomial of a morphism of matroids. III: Vectorial matroids, A sharp bound on the size of a connected matroid, On the foundations of linear and integer linear programming I, Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra, A note on immersion minors and planarity, Proving total dual integrality with cross-free families—A general framework, Matrices over finite fields and their Kirchhoff graphs, Flexible resource allocation to interval jobs, The contributions of W.T. Tutte to matroid theory, The minimal \(\mathbb{Z}_n\)-symmetric graphs that are not \(\mathbb{Z}_n\)-spherical, Recognising graphic and matroidal connectivity functions, Matroids with few non-common bases, Des cycles et cocycles en hypergraphes, On the chromatic number of binary matroids, Partial matroid representations, Polynomials with the half-plane property and the support theorems, Graphic matroids and the multicommodity transportation problem, Complexity of packing common bases in matroids, Graph minor theory, Totally free arrangements of hyperplanes, Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups, Describing quasi-graphic matroids, Modular Constructions for Combinatorial Geometries, Submodular functions and independence structures, Criteria for the global consistency of two-threshold preference relations in terms of forbidden subconfigurations, Biased graphs whose matroids are special binary matroids, On an excluded-minor class of matroids, Algebraic relations between matroids connected by weak homomorphisms, A characterisation of binary transversal structures, The Tutte polynomial, On the regularity of orientable matroids, Counterexamples to conjectures on 4-connected matroids, Matroids with Sylvester property, Equicardinal matroids, Geometric algebra for combinatorial geometries, Matroids, delta-matroids and embedded graphs, On the representation of configurations in projective spaces, Matroid basis graphs. I, An interrelation between line graphs, eigenvalues, and matroids, Matroid basis graphs. II, Uniformität des Verbandes der Partitionen, Balanced Valuations and Flows in Multigraphs, On the efficiency of representability tests for matroids, Characterizations of signed graphs, The directions determined by n points in the plane: A matroidal generalization, A unified treatment of the geometric algebra of matroids and even \(\Delta\)-matroids, Properties of matroids characterizable in terms of excluded matroids, Bipartite graphs that are not circle graphs, Characterizations of matroids with an element lying in a restricted number of circuits, Integer plane multiflow maximisation: one-quarter-approximation and gaps, Interpretations of the Tutte polynomials of regular matroids, Weak Maps of Combinatorial Geometries, An algorithm for constructing edge-trees from hypergraphs, Kuratowski's theorem, Generalized \(\Delta\text{--}Y\) exchange and \(k\)-regular matroids, Polynomials associated with nowhere-zero flows, Multimatroids. IV: Chain-group representations, Extensions of the critical theorem, Matroids Determine the Embeddability of Graphs in Surfaces, Non-separating cocircuits avoiding some elements, Cuts and flows of cell complexes, On the decomposition of vector spaces, The moduli space of matroids, Nowhere-zero integral chains and flows in bidirected graphs, Hyperplace arrangements and box splines, An extension of Lindström's result about characteristic sets of matroids, A construction for binary matroids, Unimodularity and circle graphs, Adjoints of binary matroids, Duality theory for finite and infinite matroids with coefficients, The incidence structure of subspaces with well-scaled frames, Reducing prime graphs and recognizing circle graphs, The biased graphs whose matroids are binary, Characterizations of finitary and cofinitary binary matroids, Turán's triangle theorem and binary matroids, The Tutte group of a weakly orientable matroid, On the fundamental group of 3-gems and a `planar' class of 3-manifolds, Polyhedra of regular p-nary group problems, Subspaces with well-scaled frames, A short proof of Tutte's characterization of totally unimodular matrices, Confinement of matroid representations to subsets of partial fields, The lattice of integer flows of a regular matroid, A short proof of the Truemper-Tseng theorem on max-flow min-cut matroids, On the matroids in which all hyperplanes are binary, Counting 2-connected deletion-minors of binary matroids, Flows and generalized coloring theorems in graphs, Matroid representation over GF(3), Stability, fragility, and Rota's conjecture, Independence systems with continuous cardinality of bases, Non-separating induced cycles in graphs, Representation over a field of full simplicial matroids, Resistance scaling and the number of spanning trees in self-similar lattices, Nonexistence of seven-dimensional tangential 2-blocks, Alpha-balanced graphs and matrices and GF(3)-representability of matroids, On the sum of matroids. III, Separating cocircuits in binary matroids, A characterization of unimodular orientations of simple graphs, Characterizing graphic matroids by a system of linear equations, Representability of \(\bigtriangleup\)-matroids over \(GF(2)\), \(k\)-elimination property for circuits of matroids, Projective equivalence of matroids with coefficients, Associativity in multiary quasigroups: The way of biased expansions, Triangles in 3-connected matroids, Relations between the circumference and \(e\)-circumference of a matroid, Delta matroids whose fundamental graphs are bipartite, On chains of matroids in the weak order, A MacWilliams type identity for matroids, Perfect matroids, Valuated matroids, A unified interpretation of several combinatorial dualities, Cycle lengths and circuit matroids of graphs, Coordinatization of B-matroids, A new characterization of graphic matroids, Inclusion of forbidden minors in random representable matroids, Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm, Extensions of Tutte's wheels-and-whirls theorem, A decomposition theory for matroids. VII: Analysis of minimal violation matrices, The 3-connected matroids with circumference 6, Lifts of matroid representations over partial fields, A combinatorial generalization of polytopes, Truncations of principal geometries, A composition for matroids, Circuit and fractional circuit covers of matroids, The principal minors of a matroid, Two algorithms for matroids, The Euler circuit theorem for binary matroids, On tangential 2-blocks, Nonexistence of six-dimensional tangential 2-block, A strengthened form of Tutte's characterization of regular matroids, Characterizing binary simplicial matroids, Kuratowski's and Wagner's theorems for matroids, The regular matroids with no 5-wheel minor, A min-max relation for stable sets in graphs with no odd-\(K_ 4\), Reconstruction of the orientation class of an oriented matroid, Chords and disjoint paths in matroids, Performance bounds with curvature for batched greedy optimization, Orientability of matroids, A combinatorial abstraction of linear programming, The matroids with the max-flow min-cut property, Matroid Designs of Prime Power Index, Characterizations of regular magic graphs, On cographic regular matroids, On Reid's characterization of the ternary matroids, On Hartfiel and Maxson's definition of connected sets of a matroid, Geometries simpliciales unimodulaires, Biased graphs. I: Bias, balance, and gains, Matroids on partially ordered sets, The practical conversion of linear programmes to network flow models, A group-theoretic interpretation of Tutte's homotopy theory, Une rélation de séparation entre cocircuits d'un matroide, Generalizations of magic graphs, Matroids with a unique non-common circuit containing a fixed element, On binary identically self-dual matroids, A note on the critical problem for matroids, A geometric approach to forbidden minors for GF(3), A generalization to bases common to r binary matroids of the weighted matrix-tree theorem in the case when the weights are Boolean, Infinite coverings of cages, Circuit preserving edge maps. II, Cycle covering in bridgeless graphs, A finite crisscross method for oriented matroids, A circuit characterization of graphic matroids, Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation, Recognizing Even-Cycle and Even-Cut Matroids, Infinite Matroids, Semimodular Functions and Combinatorial Geometries, On the existence of special depth first search trees, Non-Binary Matroids Having At Most Three Non-Binary Elements, Constructing Prime-Field Planar Configurations, Properties of finite character of independence spaces, Recognizing even-cycle and even-cut matroids, The connectivity and Hamiltonian properties of second-order circuit graphs of wheel cycle matroids, Stable matching: An integer programming approach, Odd Solutions to Systems of Inequalities Coming From Regular Chain Groups, The b‐bibranching problem: TDI system, packing, and discrete convexity, Existence Theorems for Matroid Designs, On matroids with the same connectivity function, Lattice of integer flows and the poset of strongly connected orientations for regular matroids, The enemy of my enemy is my friend: new conditions for network games, Orientations of golden-mean matroids, DFS tree construction: Algorithms and characterizations, Blocking and anti-blocking pairs of polyhedra, Basis graphs of pregeometries, On Matroids Representable over 𝐺𝐹(3) and Other Fields, Induced Matroids, A Combinatorial Model for Series-Parallel Networks, A Decomposition for Combinatorial Geometries, Unnamed Item, A Characterization of Graphic Matroids Based on Circuit Orderings, A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices, On circuit valuation of matroids, A characterization of n-connected splitting matroids, Properties of rank preserving weak maps, Nowhere zero 4‐flow in regular matroids, Characterizations of transversal matroids and their presentations, Reflections on graph theory, The Closure Operator of es-Splitting Matroids, Nonseparating Cocircuits in Binary Matroids, On the sum of matroids, The minimum number of edges and vertices in a graph with edge connectivity 𝑛 and 𝑚 𝑛-bonds, Characterizations of transversal matroids and their presentations
