Combinatorial Configurations
From MaRDI portal
Cited in
(26)- Optimal weighing designs with a string property
- Configuration space of geometric objects
- A forbidden configuration theorem of Alon
- D-optimal weighing designs with circular string property under SLS estimation
- Intersection properties of finite sets
- An approach to solving \(A^{k}=J-I\)
- Forbidden configurations: Induction and linear algebra
- Testing for class membership in multi-parent hierarchies
- A characterization of totally balanced hypergraphs
- Cyclic arrangements with minimum modulo \(m\) winding numbers
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- A Fundamental Matrix Equation for Finite Sets
- D-optimal statistical designs with restricted string property
- Properties of (0,1)-matrices with no triangles
- Properties of (0,1)-matrices without certain configurations
- Recognizing Helly edge-path-tree graphs and their clique graphs
- Totally positive matrices and totally positive hypergraphs
- A characterization of (,2)-stable (0,1) matrices
- On joint realization of (0,1) matrices
- Convexity in Graphs and Hypergraphs
- Asymptotically optimal weighing designs with string property
- General forbidden configuration theorems
- Exact bounds for \((\lambda,n)\)-stable 0-1 matrices.
- Information storage and retrieval - mathematical foundations. II: Combinatorial problems
- A structure theorem for the consecutive 1's property
- Circular representation problem on hypergraphs
This page was built for publication: Combinatorial Configurations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5579517)
