General forbidden configuration theorems

DOI10.1016/0097-3165(85)90050-0zbMath0619.05015OpenAlexW2038655102MaRDI QIDQ1089344

Richard P. Anstee

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(85)90050-0

Mathematics Subject Classification ID

Hypergraphs (05C65) Permutations, words, matrices (05A05) Other designs, configurations (05B30)

Related Items (10)

Rings of geometries. I ⋮ Forbidden configurations: Induction and linear algebra ⋮ A generalization of Sauer's lemma ⋮ Forbidden submatrices ⋮ Small forbidden configurations ⋮ Bounding one-way differences ⋮ A forbidden configuration theorem of Alon ⋮ A Sauer-Shelah-Perles lemma for lattices ⋮ On forbidden submatrices ⋮ Matrices with forbidden subconfigurations

Cites Work

• Properties of (0,1)-matrices with no triangles
• Properties of (0,1)-matrices without certain configurations
• Matrices with forbidden subconfigurations
• On the number of sets in a null t-design
• A combinatorial problem; stability and order for models and theories in infinitary languages
• On the density of families of sets
• Intersection properties of finite sets
• The Term Rank of a Matrix
• Characterizations of totally balanced matrices
• Switching Sets in PG(3, q)
• Combinatorial Configurations
• A Fundamental Matrix Equation for Finite Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: General forbidden configuration theorems