The following pages link to (Q5390304):
Displaying 50 items.
- Matroid invariants and counting graph homomorphisms (Q252626) (← links)
- Rainbow sets in the intersection of two matroids (Q256994) (← links)
- A circuit characterization of graphic matroids (Q257006) (← links)
- Algebraic systems biology: a case study for the Wnt pathway (Q257144) (← links)
- Algorithms for the minimum weight of linear codes (Q259293) (← links)
- The binary matroids whose only odd circuits are triangles (Q272893) (← links)
- On Rota's conjecture and nested separations in matroids (Q273161) (← links)
- Robust probability updating (Q282914) (← links)
- Secret-sharing matroids need not be algebraic (Q284751) (← links)
- Bicircular matroids representable over \(\mathrm{GF}(4)\) or \(\mathrm{GF}(5)\) (Q297920) (← links)
- Matroid union -- graphic? binary? neither? (Q298959) (← links)
- On the number of matroids (Q313452) (← links)
- Packing non-zero \(A\)-paths via matroid matching (Q317424) (← links)
- First order convergence of matroids (Q326662) (← links)
- Towards a splitter theorem for internally 4-connected binary matroids. IX. The theorem. (Q326807) (← links)
- On zeros of the characteristic polynomial of matroids of bounded tree-width (Q338570) (← links)
- Bounding and stabilizing realizations of biased graphs with a fixed group (Q345077) (← links)
- The intersection ring of matroids (Q345110) (← links)
- The popular matching and condensation problems under matroid constraints (Q346527) (← links)
- On total unimodularity of edge-edge adjacency matrices (Q378224) (← links)
- Inequivalent representations of matroids over prime fields (Q394760) (← links)
- Towards a splitter theorem for internally 4-connected binary matroids. III (Q394807) (← links)
- Towards a splitter theorem for internally 4-connected binary matroids. IV (Q395237) (← links)
- Towards a splitter theorem for internally 4-connected binary matroids. V (Q395238) (← links)
- The adjacency matroid of a graph (Q396844) (← links)
- Interlace polynomials for multimatroids and delta-matroids (Q402472) (← links)
- The number of rank-\(k\) flats in a matroid with no \(U_{2, n}\)-minor (Q403369) (← links)
- A geometric version of the Andrásfai-Erdős-Sós theorem (Q404285) (← links)
- A splitter theorem relative to a fixed basis (Q404382) (← links)
- Linking rigid bodies symmetrically (Q404454) (← links)
- Modular decomposition of the Orlik-Terao algebra (Q404470) (← links)
- An upgraded Wheels-and-Whirls theorem for 3-connected matroids (Q414635) (← links)
- Towards a splitter theorem for internally 4-connected binary matroids (Q414641) (← links)
- Capturing matroid elements in unavoidable 3-connected minors (Q427796) (← links)
- Bounding the coefficients of the characteristic polynomials of simple binary matroids (Q427869) (← links)
- An entropy argument for counting matroids (Q462939) (← links)
- Delta-wye reduction of almost-planar graphs (Q476317) (← links)
- \( h\)-vectors of matroids and logarithmic concavity (Q481673) (← links)
- Binary matroids and local complementation (Q482118) (← links)
- On the number of matroids compared to the number of sparse paving matroids (Q491548) (← links)
- Extensions and presentations of transversal matroids (Q491730) (← links)
- The graphicity of the union of graphic matroids (Q491733) (← links)
- Weak orientability of matroids and polynomial equations (Q491739) (← links)
- The number of lines in a matroid with no \(U_{2,n}\)-minor (Q491746) (← links)
- Minimal non-orientable matroids of rank three (Q491749) (← links)
- On chains of matroids in the weak order (Q491754) (← links)
- The transition matroid of a 4-regular graph: an introduction (Q491757) (← links)
- Characterizing binary matroids with no \(P_9\)-minor (Q494129) (← links)
- The number of elements belonging to triads in 3-connected binary matroids (Q501058) (← links)
- Algebraic matroids and set-theoretic realizability of tropical varieties (Q501684) (← links)
