scientific article; zbMATH DE number 5047784
From MaRDI portal
Publication:5484515
Recommendations
Cited in
(only showing first 100 items - show all)- Locally defined independence systems on graphs
- scientific article; zbMATH DE number 5057511 (Why is no real title available?)
- scientific article; zbMATH DE number 5062025 (Why is no real title available?)
- The joints problem for matroids
- A matroid-friendly basis for the quasisymmetric functions
- Diversity, dependence and independence
- Homological properties of Orlik-Solomon algebras
- Recognizing Cartesian products of matrices and polytopes
- On graphs uniquely defined by their \(K\)-circular matroids
- Evaluation and interpolation over multivariate skew polynomial rings
- Classification of external zonotopal algebras
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- Electrical networks and hyperplane arrangements
- Multigraded shifts of matroidal ideals
- Varieties of signature tensors
- Hyperplane arrangements and Milnor fibrations
- Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits
- Combinatorial optimization with interaction costs: complexity and solvable cases
- scientific article; zbMATH DE number 952951 (Why is no real title available?)
- On the half-plane property and the Tutte group of a matroid
- Formalizing Some “Small” Finite Models of Projective Geometry in Coq
- On the basis pair graphs of signed-graphic matroids
- Dilworth truncations and \(k\)-induced matroids
- Extended formulations for matroid polytopes through randomized protocols
- Matroids arising from electrical networks
- The relationships between posets and independent sets of a matroid of arbitrary cardinality
- Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees
- Topology of augmented Bergman complexes
- Contractible edges in 3-connected graphs that preserve a minor
- Fast exact algorithms for survivable network design with uniform requirements
- Rough set methods in feature selection via submodular function
- Topics in Matroid Theory
- Pure \(O\)-sequences and matroid \(h\)-vectors
- Matroidizing set systems: A new approach to matroid theory
- Wei-type duality theorems for matroids
- Detecting binomiality
- Broken circuit complexes and hyperplane arrangements
- Spanning trees with specified differences in Cayley graphs
- The matroid stratification of the Hilbert scheme of points on \(\mathbb{P}^1\)
- Greedy-type resistance of combinatorial problems
- Ghost symmetry and an analogue of Steinitz's theorem
- Geometry of cuts and metrics
- Finding even subgraphs even faster
- A splitter theorem on 3-connected matroids
- On minors avoiding elements in matroids
- On Fair Division under Heterogeneous Matroid Constraints
- Grassmann homomorphism and Hajós-type theorems
- Deterministic parameterized algorithms for the graph motif problem
- Higher dimensional electrical circuits
- Computing the largest bond and the maximum connected cut of a graph
- On the regularity of orientable matroids
- Generalized weights of codes over rings and invariants of monomial ideals
- Buchstaber invariant theory of simplicial complexes and convex polytopes
- The algebraic matroid of the finite unit norm tight frame (funtf) variety
- On posets and independence spaces
- Broken circuit complexes of series-parallel networks
- Stiefel tropical linear spaces
- \(k\)-sum decomposition of strongly unimodular matrices
- \(k\)-circular matroids of graphs
- Hispanic Heritage Month
- Quantitative combinatorial geometry for concave functions
- scientific article; zbMATH DE number 7498835 (Why is no real title available?)
- How many circuits determine an oriented matroid?
- Generalized permutohedra, \(h\)-vectors of cotransversal matroids and pure \(O\)-sequences
- Information hiding using matroid theory
- Sublinear circuits for polyhedral sets
- Matroid bases with cardinality constraints on the intersection
- Auctions with interdependence and SOS: improved approximation
- Tangle bases: Revisited
- Hopf algebras for matroids over hyperfields
- Regular matroids have polynomial extension complexity
- Triangle-roundedness in matroids
- Slack matrices, \(k\)-products, and 2-level polytopes
- Simultaneous feedback edge set: a parameterized perspective
- Single commodity-flow algorithms for lifts of graphic and cographic matroids
- On the parameterized complexity of \textsc{Girth} and \textsc{Connectivity} problems on linear matroids
- Tropical moduli spaces of rational graphically stable curves
- An overview of complex fractal dimensions: from fractal strings to fractal drums, and back
- On the reliability roots of simplicial complexes and matroids
- Representing matroids over the reals is \(\exists \mathbb{R}\)-complete
- Parameterized complexity of conflict-free matchings and paths
- Subdeterminant maximization via nonconvex relaxations and anti-concentration
- Formal barriers to simple algorithms for the matroid secretary problem
- Proto-exact categories of modules over semirings and hyperrings
- The Tutte polynomial of matroids constructed by a family of splitting operations
- Parameterized complexity of conflict-free set cover
- Rational roots of all‐terminal reliability
- Two cryptomorphic formalizations of projective incidence geometry
- A combinatorial mapping for the higher-dimensional matrix-tree theorem
- Theory and applications of linearized multivariate skew polynomials
- Quotients of uniform positroids
- On the Complexity of Stackelberg Matroid Pricing Problems
- Approximation in mechanism design with interdependent values
- On ideal and weakly-ideal access structures
- Fully dynamic clustering and diversity maximization in doubling metrics
- On decomposable correlation matrices
- A family of matrix-tree multijections
- Tutte polynomials for regular oriented matroids
- Isolating a vertex via lattices: polytopes with totally unimodular faces
- Information theoretically secure hypothesis test for temporally unstructured quantum computation (extended abstract)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5484515)
