Publication:5390304

From MaRDI portal


zbMath1254.05002MaRDI QIDQ5390304

James G. Oxley

Publication date: 1 April 2011



05-02: Research exposition (monographs, survey articles) pertaining to combinatorics

05B35: Combinatorial aspects of matroids and geometric lattices


Related Items

Gaussoids are two-antecedental approximations of Gaussian conditional independence structures, A method to construct all the paving matroids over a finite set, Computation of Dressians by dimensional reduction, A note on geometric duality in matroid theory and knot theory, Unbreakable matroids, Ehrhart polynomials of rank two matroids, On the structure of triangle-free 3-connected matroids, On the complex-representable excluded minors for real-representability, Stability and exact Turán numbers for matroids, Logarithmic concavity for morphisms of matroids, Orientable arithmetic matroids, Fundamental polytopes of metric trees via parallel connections of matroids, The distance-constrained matroid median problem, Binary signed-graphic matroids: representations and recognition algorithms, Frame matroids, toric ideals, and a conjecture of White, On density-critical matroids, Reflexive polytopes arising from bipartite graphs with \(\gamma\)-positivity associated to interior polynomials, Convexity in ordered matroids and the generalized external order, Rank-metric codes and \(q\)-polymatroids, Free resolutions of function classes via order complexes, Decomposable polymatroids and connections with graph coloring, Strict log-concavity of the Kirchhoff polynomial and its applications, Simplicial generation of Chow rings of matroids, Undecidability of \(c\)-arrangement matroid representations, Cooperative games on simplicial complexes, Chvátal-Erdős conditions and almost spanning trails, Lorentzian polynomials, Tutte's dichromate for signed graphs, Modular construction of free hyperplane arrangements, Duality respecting representations and compatible complexity measures for gammoids, On \(s\)-Hamiltonicity of net-free line graphs, Common information, matroid representation, and secret sharing for matroid ports, A positivity phenomenon in Elser's Gaussian-cluster percolation model, The templates for some classes of quaternary matroids, Matroid connectivity and singularities of configuration hypersurfaces, Branch-depth: generalizing tree-depth of graphs, Representations of torsion-free arithmetic matroids, Greedy weights for matroids, The smallest matroids with no large independent flat, Bounding the beta invariant of 3-connected matroids, Tropical flag varieties, Feynman graphs and hyperplane arrangements defined over \(\mathbb{F}_1\), Extended random assignment mechanisms on a family of good sets, Counting matroids in minor-closed classes, Unavoidable parallel minors of regular matroids, Face numbers of Engström representations of matroids, On connectivity of the facet graphs of simplicial complexes, Excluded minors are almost fragile, \(N\)-detachable pairs in 3-connected matroids. I: Unveiling \(X\), The Chow form of a reciprocal linear space, Orbits in \((\mathbb{P}^r)^n\) and equivariant quantum cohomology, The rank function of a positroid and non-crossing partitions, A characterization of circle graphs in terms of multimatroid representations, Popular matchings with two-sided preference lists and matroid constraints, Flats of a positroid from its decorated permutation, Matroidal representations of groups, Dominance and deficiency for Petri nets and chemical reaction networks, On power ideals of transversal matroids and their ``parking functions, Semi-inverted linear spaces and an analogue of the broken circuit complex, The slack realization space of a matroid, A module-theoretic approach to matroids, Matroids, delta-matroids and embedded graphs, Two examples of toric arrangements, Combinatorics of toric arrangements, Matroids with a cyclic arrangement of circuits and cocircuits, The graphs that have antivoltages using groups of small order, Dependencies among dependencies in matroids, Characterizations of matroids with an element lying in a restricted number of circuits, A note on the connectivity of 2-polymatroid minors, Unavoidable minors for connected 2-polymatroids, Linear relations for a generalized Tutte polynomial, Enumerating colorings, tensions and flows in cell complexes, A density Hales-Jewett theorem for matroids, Matroid 3-connectivity and branch width, Representability of matroids with a large projective geometry minor, Special issue in honour of James Oxley, Semidirect sums of matroids, An algorithm for constructing a \(k\)-tree for a \(k\)-connected matroid, Obstacles to decomposition theorems for sixth-root-of-unity matroids, Unavoidable minors of large 4-connected bicircular matroids, The highly connected matroids in minor-closed classes, A characterization of tangle matroids, Internally 4-connected binary matroids without a prism+\(e\) minor, On regular matroids without certain minors, On Seymour's decomposition theorem, Non-separating cocircuits avoiding some elements, Fan-extensions in fragile matroids, Projective geometries in exponentially dense matroids. I., Projective geometries in exponentially dense matroids. II., On two conjectures of maurer concerning basis graphs of matroids, Matroids denser than a clique, Determinantal schemes and pure O-sequences, Valid orderings of real hyperplane arrangements, Inductive tools for connected delta-matroids and multimatroids, Isotropic matroids. III: Connectivity, Matroidal structure of skew polynomial rings with application to network coding, Matroids from hypersimplex splits, Excluding Kuratowski graphs and their duals from binary matroids, The structure of matroids with a spanning clique or projective geometry, On kernelization and approximation for the vector connectivity problem, Matroid invariants and counting graph homomorphisms, Rainbow sets in the intersection of two matroids, A circuit characterization of graphic matroids, Algebraic systems biology: a case study for the Wnt pathway, Algorithms for the minimum weight of linear codes, The binary matroids whose only odd circuits are triangles, On Rota's conjecture and nested separations in matroids, Robust probability updating, Secret-sharing matroids need not be algebraic, Bicircular matroids representable over \(\mathrm{GF}(4)\) or \(\mathrm{GF}(5)\), Matroid union -- graphic? binary? neither?, On the number of matroids, Packing non-zero \(A\)-paths via matroid matching, First order convergence of matroids, Towards a splitter theorem for internally 4-connected binary matroids. IX. The theorem., On zeros of the characteristic polynomial of matroids of bounded tree-width, Bounding and stabilizing realizations of biased graphs with a fixed group, The intersection ring of matroids, The popular matching and condensation problems under matroid constraints, On total unimodularity of edge-edge adjacency matrices, Inequivalent representations of matroids over prime fields, Towards a splitter theorem for internally 4-connected binary matroids. III, Towards a splitter theorem for internally 4-connected binary matroids. IV, Towards a splitter theorem for internally 4-connected binary matroids. V, The adjacency matroid of a graph, Interlace polynomials for multimatroids and delta-matroids, The number of rank-\(k\) flats in a matroid with no \(U_{2, n}\)-minor, A geometric version of the Andrásfai-Erdős-Sós theorem, A splitter theorem relative to a fixed basis, Linking rigid bodies symmetrically, Modular decomposition of the Orlik-Terao algebra, An upgraded Wheels-and-Whirls theorem for 3-connected matroids, Towards a splitter theorem for internally 4-connected binary matroids, Capturing matroid elements in unavoidable 3-connected minors, Bounding the coefficients of the characteristic polynomials of simple binary matroids, An entropy argument for counting matroids, Delta-wye reduction of almost-planar graphs, \( h\)-vectors of matroids and logarithmic concavity, Binary matroids and local complementation, On the number of matroids compared to the number of sparse paving matroids, Extensions and presentations of transversal matroids, The graphicity of the union of graphic matroids, Weak orientability of matroids and polynomial equations, The number of lines in a matroid with no \(U_{2,n}\)-minor, Minimal non-orientable matroids of rank three, On chains of matroids in the weak order, The transition matroid of a 4-regular graph: an introduction, Characterizing binary matroids with no \(P_9\)-minor, The number of elements belonging to triads in 3-connected binary matroids, Algebraic matroids and set-theoretic realizability of tropical varieties, Dimensional reduction for generalized continuum polymers, Towards a splitter theorem for internally 4-connected binary matroids. VIII: Small matroids., Theta rank, levelness, and matroid minors, Partitioning the bases of the union of matroids, Characterization and reduction of concept lattices through matroid theory, Sign variation, the Grassmannian, and total positivity, Enumerating matroids of fixed rank, Laminar matroids, Lattices related to extensions of presentations of transversal matroids, Transformation and decomposition of clutters into matroids, Toric ideals of lattice path matroids and polymatroids, On bipartite restrictions of binary matroids, The structure of the 4-separations in 4-connected matroids, Towards a splitter theorem for internally 4-connected binary matroids. VII, Orienting transversals and transition polynomials of multimatroids, Explicit bounds for graph minors, Non-representable hyperbolic matroids, Isotropic matroids. I: Multimatroids and neighborhoods, Isotropic matroids. II: Circle graphs, Connectivity functions and polymatroids, Tangles, trees, and flowers, On matroid minors that guarantee their duals as minors, On the Orlik-Terao ideal and the relation space of a hyperplane arrangement, On matroids with few circuits containing a pair of elements, Matroids with a unique non-common circuit containing a fixed element, On matroid parity and matching polytopes, Circuit-difference matroids, Coordinate-wise powers of algebraic varieties, A generalisation of uniform matroids, Clustered planarity testing revisited, The critical number of dense triangle-free binary matroids, Recombination faults in gene assembly in ciliates modeled using multimatroids, An infinite family of excluded minors for strong base-orderability, A matroid analogue of a theorem of Brooks for graphs, On the edge crossing properties of Euclidean minimum weight Laman graphs, Certifying non-representability of matroids over prime fields, Infinite gammoids: minors and duality, Tropical linear spaces and tropical convexity, The intersection of a matroid and an oriented matroid, Many 2-level polytopes from matroids, A minimal 3-connectedness result for matroids, Signed graphs and the freeness of the Weyl subarrangements of type \(B_\ell\), Universal Tutte characters via combinatorial coalgebras, Hyperfield Grassmannians, Free multiplicities on the moduli of \(X_{3}\), On graphic matroid minors that guarantee their duals as minors, Relaxations of \(\mathrm{GF}(4)\)-representable matroids, Flags of almost affine codes and the two-party wire-TAP channel of type II, Defining the \(q\)-analogue of a matroid, Matroids with no \(U_{2,n}\)-minor and many hyperplanes, A notion of minor-based matroid connectivity, Bipartite and Eulerian minors, Algebraic matroids and Frobenius flocks, Syzygies on Tutte polynomials of freedom matroids, Improving a chain theorem for triangle-free 3-connected matroids, How many delta-matroids are there?, On packing spanning arborescences with matroid constraint, Group actions on semimatroids, The \(e\)-exchange basis graph and matroid connectedness, A note on 2-isomorphisms and the signed Laplacian matrix of a graph, On the number of circuit-cocircuit reversal classes of an oriented matroid, Antimatroids induced by matchings, Multi-splits and tropical linear spaces from nested matroids, Matroids with many small circuits and cocircuits, Counting Hamiltonian cycles in the matroid basis graph, The category of matroids, A note on immersion minors and planarity, A Grassmann algebra for matroids, Extension complexity and realization spaces of hypersimplices, The matroid structure of representative triple sets and triple-closure computation, The Cohen-Macaulayness of the bounded complex of an affine oriented matroid, Products of arithmetic matroids and quasipolynomial invariants of CW-complexes, Matrices over finite fields and their Kirchhoff graphs, Duality and the signed Laplacian matrix of a graph, Stirling numbers in braid matroid Kazhdan-Lusztig polynomials, Designing matching mechanisms under constraints: an approach from discrete convex analysis, On the number of bases of almost all matroids, On perturbations of highly connected dyadic matroids, Infinitely many excluded minors for frame matroids and for lifted-graphic matroids, Towards a splitter theorem for internally 4-connected binary matroids. VI, Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids, Relations between Möbius and coboundary polynomials, Truncation formulas for invariant polynomials of matroids and geometric lattices, On Brylawski's generalized duality, Finding lower bounds on the complexity of secret sharing schemes by linear programming, On ideal homomorphic secret sharing schemes and their decomposition, Möbius and coboundary polynomials for matroids, The inverse Kazhdan-Lusztig polynomial of a matroid, Matroid fragility and relaxations of circuit hyperplanes, Cuboids, a class of clutters, On lattice path matroid polytopes: integer points and Ehrhart polynomial, Algorithms for tight spans and tropical linear spaces, An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming, The contributions of W.T. Tutte to matroid theory, Vertices of Schubitopes, Recognising graphic and matroidal connectivity functions, Computing the spark: mixed-integer programming for the (vector) matroid girth problem, Faster deterministic \textsc{Feedback Vertex Set}, Strictness of the log-concavity of generating polynomials of matroids, \(K\)-theoretic Tutte polynomials of morphisms of matroids, Delta-matroids as subsystems of sequences of Higgs lifts, The Möbius matroids, Fractal classes of matroids, A proof of Rado's theorem via principal extension, Cyclic flats of binary matroids, Parallel translates of represented matroids, Parameterized counting of partially injective homomorphisms, \(N\)-detachable pairs in 3-connected matroids. II: Life in \(X\), Elastic elements in 3-connected matroids, Combinatorial iterated integrals and the harmonic volume of graphs, Tropical curves of hyperelliptic type, The structure of claw-free binary matroids, \(N\)-critical matroids, Gorenstein graphic matroids, On facets of the Newton polytope for the discriminant of the polynomial system, Envy-free matchings with one-sided preferences and matroid constraints, Characterizing matroids whose bases form graphic delta-matroids, Secretary problem: graphs, matroids and greedoids, The family of bicircular matroids closed under duality, \(N\)-detachable pairs in 3-connected matroids. III: The theorem, A new matroid lift construction and an application to group-labeled graphs, Modified log-Sobolev inequalities, Beckner inequalities and moment estimates, The Tutte polynomial via lattice point counting, Gröbner bases of toric ideals associated with matroids, Stanley-Reisner rings and the occurrence of the Steinberg representation in the hit problem, Isometric structure of transportation cost spaces on finite metric spaces, \(q\)-polymatroids and their relation to rank-metric codes, Present-biased optimization, Eulerian and bipartite binary delta-matroids, A semi-small decomposition of the Chow ring of a matroid, Strengthened chain theorems for different versions of 4-connectivity, Whitney numbers of matroid extensions and co-extensions, The free \(m\)-cone of a matroid and its \({\mathcal{G}} \)-invariant, Hypergraph characterization of split matroids, Minimally globally rigid graphs, Elimination properties for minimal dominating sets of graphs, The universal covers of hypertoric varieties and Bogomolov's decomposition, Idealness of \(k\)-wise intersecting families, Correlation bounds for fields and matroids, A characterization of circle graphs in terms of total unimodularity, Rainbow and monochromatic circuits and cocircuits in binary matroids, A matroid operation that commutes with duality, A determinantal formula for circuits of integer lattices, Matrix representations of frame and lifted-graphic matroids correspond to gain functions, Enumeration of extensions of the cycle matroid of a complete graph, Matroids are not Ehrhart positive, On Tutte polynomial expansion formulas in perspectives of matroids and oriented matroids, Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials, Graph theory -- a survey on the occasion of the Abel Prize for László Lovász, Tree automata and pigeonhole classes of matroids. I, Unnamed Item, Unnamed Item, Covering Vectors by Spaces: Regular Matroids, Tropical Computations in polymake, Doubly Exponentially Many Ingleton Matroids, Generalized Permutohedra from Probabilistic Graphical Models, Higher Resonance Varieties of Matroids, Cryptomorphisms for Abstract Rigidity Matroids, A Matroid Extension Result, On a Generalization of Spikes, Yes, the “missing axiom” of matroid theory is lost forever, A Characterization of Graphic Matroids Based on Circuit Orderings, The Highly Connected Even-Cycle and Even-Cut Matroids, $h^\ast $-polynomials of zonotopes, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Cycles, cocycles, and duality on tropical manifolds, On the Generation of Rank 3 Simple Matroids with an Application to Terao's Freeness Conjecture, On the Highly Connected Dyadic, Near-Regular, and Sixth-Root-of-Unity Matroids, On basic operations related to network induction of discrete convex functions, Finding Branch-Decompositions of Matroids, Hypergraphs, and More, Market Pricing for Matroid Rank Valuations, Nonseparating Cocircuits in Binary Matroids, Modules whose submodule lattice is lower finite, Idealness of k-wise Intersecting Families, Recognizing Even-Cycle and Even-Cut Matroids, The combinatorics of normal subgroups in the unipotent upper triangular group, Even circuits in oriented matroids, Strong shellability of simplicial complexes, Reconstructibility of Matroid Polytopes, Clean Clutters and Dyadic Fractional Packings, Generic Symmetry-Forced Infinitesimal Rigidity: Translations and Rotations, Excluded minors for the class of split matroids, Logarithmic concavity of Schur and related polynomials, A Matroid Generalization of the Super-Stable Matching Problem, The 9-Connected Excluded Minors for the Class of Quasi-graphic Matroids, The Structure of $I_4$-Free and Triangle-Free Binary Matroids, Combinatorics of the geometry of Wilson loop diagrams I: equivalence classes via matroids and polytopes, The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements, The connectivity and Hamiltonian properties of second-order circuit graphs of wheel cycle matroids, Random ℓ‐colourable structures with a pregeometry, Linear bounds on characteristic polynomials of matroids, Matroids that classify forests, Spanning-Tree Games., A lattice point counting generalisation of the Tutte polynomial, Strategy-proof school choice mechanisms with minimum quotas and initial endowments, Almost balanced biased graph representations of frame matroids, A splitter theorem for 3-connected 2-polymatroids, A counting lemma for binary matroids and applications to extremal problems, A generalized-polymatroid approach to disjoint common independent sets in two matroids, Generalized laminar matroids, On the Gorensteinness of broken circuit complexes and Orlik-Terao ideals, On the Tutte-Krushkal-Renardy polynomial for cell complexes, On the evaluation at \(( - \iota ,\iota )\) of the Tutte polynomial of a binary matroid, On two classes of nearly binary matroids, Towards a splitter theorem for internally 4-connected binary matroids. II, On preserving matroid 3-connectivity relative to a fixed basis, Bicircular signed-graphic matroids, Toric and tropical compactifications of hyperplane complements, Frameworks with forced symmetry. II: Orientation-preserving crystallographic groups, New light on Bergman complexes by decomposing matroid types, A non-abelian analogue of Whitney's 2-isomorphism theorem, The Tutte polynomial of a morphism of matroids. V: Derivatives as generating functions of Tutte activities, Rainbow sets in the intersection of two matroids: a generalization of results of Drisko and Chappell, Determining a binary matroid from its small circuits, Cyclic flats of a polymatroid, Strict log-concavity of the Kirchhoff polynomial and its applications to the strong Lefschetz property, On characterizing the class of cographic signed-graphic matroids, On the Dowling and Rhodes lattices and wreath products, The binary matroids with no odd circuits of size exceeding five, Serial exchanges in matroids, Clean tangled clutters, simplices, and projective geometries, Matroids with different configurations and the same \(\mathcal{G} \)-invariant, Twist polynomials of delta-matroids, Local 2-separators, Independent spaces of \(q\)-polymatroids, Matroid relaxations and Kazhdan-Lusztig non-degeneracy, A Wheels-and-Whirls Theorem for $3$-Connected $2$-Polymatroids, The Structure of $\{U_{2,5}, U_{3,5}\}$-Fragile Matroids, Unavoidable Connected Matroids Retaining a Specified Minor, Precision and Sensitivity in Detailed-Balance Reaction Networks, Matroid Theory for Algebraic Geometers, Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs, Dominance and T-Invariants for Petri Nets and Chemical Reaction Networks, Templates for Binary Matroids, Finding a Maximum-Weight Convex Set in a Chordal Graph, Bergman Complexes of Lattice Path Matroids, Continuous Matroids Revisited, Coloring the Voronoi tessellation of lattices, Differentially Private and Budget-Limited Bandit Learning over Matroids, The positive Dressian equals the positive tropical Grassmannian, Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints, Matroids of gain graphs in applied discrete geometry, Matroids Representable Over Fields With a Common Subfield, Matroid Toric Ideals: Complete Intersection, Minors, and Minimal Systems of Generators, An Extension of the Brouwer-Zimmermann Minimum Weight Algorithm, h-Vectors of Matroid Complexes, Unnamed Item, On dual of the generalized splitting matroids, Matroids and the Minimum Rank Problem for Matrix Patterns, The Unbreakable Frame Matroids, A numerical toolkit for multiprojective varieties, A new matroid constructed by the rank function of a matroid, Obstructions for Bounded Branch-depth in Matroids, A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices, A New Description of Transversal Matroids Through Rough Set Approach, GEOMETRIC BIJECTIONS FOR REGULAR MATROIDS, ZONOTOPES, AND EHRHART THEORY, The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids, Minors of a random binary matroid, Algebraic Matroids in Action, Orlik-Solomon type presentations for the cohomology algebra of toric arrangements, L-Infinity Optimization to Bergman Fans of Matroids with an Application to Phylogenetics, Transitive closure and transitive reduction in bidirected graphs, Editing to Connected F-Degree Graph, Pareto Stable Matchings under One-Sided Matroid Constraints, Matroidal Choice Functions, Matroids Denser than a Projective Geometry, The densest matroids in minor-closed classes with exponential growth rate, L-Infinity Optimization to Linear Spaces and Phylogenetic Trees, Popular Matchings with Ties and Matroid Constraints, Relative cohomology of bi-arrangements, A Positivstellensatz for Sums of Nonnegative Circuit Polynomials, Encoding Binary Neural Codes in Networks of Threshold-Linear Neurons, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Sticky matroids and Kantor's conjecture, Computing with Tangles, Bounding the number of bases of a matroid, Excluded minors for matroids satisfying Kinser's inequalities, Fixing numbers for matroids, Divisors on matroids and their volumes, Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications, A note on representing dowling geometries by partitions, 2-Modular Matrices, Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming, The Extremal Function for Excluding Geometry Minors over Prime Fields