Maximal matroids in weak order posets
DOI10.1016/j.jctb.2023.10.012zbMath1530.05094arXiv2102.09901OpenAlexW3133344740MaRDI QIDQ6187341
Bill Jackson, Shin-ichi Tanigawa
Publication date: 15 January 2024
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.09901
submodularityrank functioncombinatorial rigiditymatroid erectionmatroid on a graphmatroid weak orderunique maximal matroidweakly saturated sequence
Extremal problems in graph theory (05C35) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Structural characterization of families of graphs (05C75)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An extremal problem for sets with applications to graph theory
- Hyperconnectivity of graphs
- Matroid erection and duality
- A matroid on hypergraphs, with applications in scene analysis and geometry
- When is a bipartite graph a rigid framework?
- Count matroids of group-labeled graphs
- Exact bounds for some hypergraph saturation problems
- Completion of tree metrics and rank 2 matrices
- On graphs and rigidity of plane skeletal structures
- Weakly Saturated Hypergraphs and Exterior Algebra
- Bipartite rigidity
- Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
- Rigidity Matroids
- Weakly P-saturated graphs
- Combinatorial Conditions for the Unique Completability of Low-Rank Matrices
- On Abstract Rigidity Matroids
- Abstract 3-Rigidity and Bivariate $C_2^1$-Splines II: Combinatorial Characterization
- [https://portal.mardi4nfdi.de/wiki/Publication:5871272 Abstract 3-Rigidity and Bivariate $C_2^1$-Splines I: Whiteley's Maximality Conjecture]
- Uniform families and count matroids
This page was built for publication: Maximal matroids in weak order posets
