A Certain Class of Incidence Matrices
From MaRDI portal
Cites work
Cited in
(40)- Quasi-randomness and the distribution of copies of a fixed graph
- Rank of inclusion matrices and modular representation theory
- Lower bounds on arithmetic circuits via partial derivatives
- Essential covers of the cube by hyperplanes
- Resilience of ranks of higher inclusion matrices
- Equality of graphs up to complementation
- Perfect sequence covering arrays
- Several anzahl formulas of classical spaces and their applications
- Hypomorphy of graphs up to complementation
- Recent progress in algebraic design theory
- A note on the rank of inclusion matrices
- Quasi-randomness of graph balanced cut properties
- On the rank of higher inclusion matrices
- Weak quasi-randomness for uniform hypergraphs
- The quasi-randomness of hypergraph cut properties
- When is the orbit algebra of a group an integral domain ? Proof of a conjecture of P.J. Cameron
- Incidence matrices of finite attenuated spaces and class dimension of association schemes
- More on the Wilson \(W_{tk}(v)\) matrices
- On the inclusion matrix \(W_{23}(v)\)
- Vector fields and classical theorems of topology
- On the number of edges of a graph and its complement
- The effect of edge weights on clique weights
- Top-heavy phenomena for transformations
- Harmonic polynomials on perfect matchings
- Inclusion matrices for rainbow subsets
- Quasi-random graphs and graph limits
- Garland's method for token graphs
- Asymptotic behavior of Laplacian eigenvalues of subspace inclusion graphs
- A short proof of the rank formula for inclusion matrices
- The vector space generated by permutations of a trade or a design
- Ordered structures with no finite monomorphic decomposition: application to the profile of hereditary classes
- Covering the hypercube, the uncertainty principle, and an interpolation formula
- Total trades, intersection matrices and Specht modules
- On the \(k\)-volume rigidity of a simplicial complex in \(\mathbb{R}^d\)
- A representation-theoretic computation of the rank of 1-intersection incidence matrices: 2-subsets vs. n -subsets.
- On the maximum degree of induced subgraphs of the Kneser graph
- Integer diagonal forms for subset intersection relations
- The degree of functions in the Johnson and q-Johnson schemes
- On approximate symmetric polynomials and tightness of homogenization results
- Shadows and intersections: Stability and new proofs
This page was built for publication: A Certain Class of Incidence Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5522934)
