On the rank of higher inclusion matrices

DOI10.1112/jlms/jdu029zbMath1307.05215arXiv1306.2197OpenAlexW1979031177MaRDI QIDQ2922841

Codruţ Grosu, Yury Person, Tibor Szabó

Publication date: 15 October 2014

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.2197

zbMATH Keywords

\(r\)-graph

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Extremal set theory (05D05)

Related Items (1)

Resilience of ranks of higher inclusion matrices

Cites Work

• On extremal hypergraphs for Hamiltonian cycles
• Shadows and intersections: Stability and new proofs
• Intersection theorems and mod \(p\) rank of inclusion matrices
• Maximum number of constant weight vertices of the unit \(n\)-cube contained in a \(k\)-dimensional subspace
• Shadows and intersections in vector spaces
• Local resilience of graphs
• Incidence Matrices of Subsets—A Rank Formula
• Sharp thresholds of graph properties, and the $k$-sat problem
• A Certain Class of Incidence Matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the rank of higher inclusion matrices