The following pages link to (Q4111952):
Displayed 50 items.
- Rainbow sets in the intersection of two matroids (Q256994) (← links)
- Bicircular matroids are 3-colorable (Q271597) (← links)
- Coincidence of the sets of minimal and irreducible join graphs over primary structure of algebraic Bayesian networks (Q276900) (← links)
- Clique cover products and unimodality of independence polynomials (Q277643) (← links)
- Linearly dependent vectorial decomposition of clutters (Q283705) (← links)
- On the number of matroids (Q313452) (← links)
- Factorization theorems for strong maps between matroids of arbitrary cardinality (Q330329) (← links)
- Transforms and minors for binary functions (Q368460) (← links)
- Two new perspectives on multi-stage group testing (Q378258) (← links)
- The adjacency matroid of a graph (Q396844) (← links)
- On sumsets of multisets in \(\mathbb{Z}_p^m\) (Q396850) (← links)
- Interlace polynomials for multimatroids and delta-matroids (Q402472) (← links)
- From clutters to matroids (Q405078) (← links)
- Bounding the coefficients of the characteristic polynomials of simple binary matroids (Q427869) (← links)
- Minmax regret bottleneck problems with solution-induced interval uncertainty structure (Q429655) (← links)
- The minimum spanning tree problem with conflict constraints and its variations (Q429679) (← links)
- Ideal multipartite secret sharing schemes (Q434350) (← links)
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems (Q444382) (← links)
- On the structure of the \(h\)-vector of a paving matroid (Q449206) (← links)
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width (Q463068) (← links)
- Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule (Q475118) (← links)
- An axiomatization of probabilistic Owen value for games with coalition structure (Q477465) (← links)
- Binary matroids and local complementation (Q482118) (← links)
- The transition matroid of a 4-regular graph: an introduction (Q491757) (← links)
- Stiefel tropical linear spaces (Q491984) (← links)
- On the generality of the greedy algorithm for solving matroid base problems (Q496445) (← links)
- Two disjoint independent bases in matroid-graph pairs (Q497297) (← links)
- Dimensional reduction for generalized continuum polymers (Q503371) (← links)
- Characterization and reduction of concept lattices through matroid theory (Q507667) (← links)
- On graphs uniquely defined by their \(K\)-circular matroids (Q516878) (← links)
- Path intersection matrices and applications to networks (Q526300) (← links)
- Transformation and decomposition of clutters into matroids (Q526353) (← links)
- \(k\)-circular matroids of graphs (Q528553) (← links)
- Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid (Q533769) (← links)
- A strong log-concavity property for measures on Boolean algebras (Q543905) (← links)
- Matroid base polytope decomposition (Q544143) (← links)
- Rigidity and the lower bound theorem. I (Q578590) (← links)
- The regular matroids with no 5-wheel minor (Q580348) (← links)
- On the complexity of embedding planar graphs to minimize certain distance measures (Q582079) (← links)
- Reconstruction of the orientation class of an oriented matroid (Q584268) (← links)
- The polytope of degree sequences (Q584289) (← links)
- A unifying approach to descriptive geometry and mechanisms (Q584736) (← links)
- On the numbers of bases and circuits in simple binary matroids (Q585212) (← links)
- On some extremal connectivity results for graphs and matroids (Q594104) (← links)
- On the critical exponent of transversal matroids (Q595668) (← links)
- Matroids and linking systems (Q599061) (← links)
- Lattice path matroids: the excluded minors (Q602714) (← links)
- On the unimodality of independence polynomials of some graphs (Q607359) (← links)
- Oriented matroid systems (Q617896) (← links)
- Connectedness of refined Goetschel-Voxman fuzzy matroids (Q622043) (← links)