Linear algebra methods for Forbidden configurations

DOI10.1007/s00493-011-2595-6zbMath1249.05377OpenAlexW2082374751MaRDI QIDQ653981

Balin Fleming, Richard P. Anstee

Publication date: 20 December 2011

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-011-2595-6

zbMATH Keywords

forbidden traceForbidden configurations

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05)

Related Items (2)

Unnamed Item ⋮ Two refinements of the bound of Sauer, Perles and Shelah, and of Vapnik and Chervonenkis

Cites Work

• Unnamed Item
• Unnamed Item
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Two refinements of the bound of Sauer, Perles and Shelah, and of Vapnik and Chervonenkis
• On disjointly representable sets
• On the VC-dimension of uniform hypergraphs
• Traces of uniform families of sets
• Small forbidden configurations
• Counterexample to the Frankl-Pach conjecture for uniform, dense families
• Small forbidden configurations. IV: The 3 rowed case
• Unavoidable traces of set systems
• Forbidding complete hypergraphs as traces
• A combinatorial problem; stability and order for models and theories in infinitary languages
• On the density of families of sets
• Disjoint representability of sets and their complements
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities

This page was built for publication: Linear algebra methods for Forbidden configurations