Repeated columns and an old chestnut
From MaRDI portal
Publication:396909
zbMATH Open1298.05310arXiv1305.0603MaRDI QIDQ396909FDOQ396909
Authors: Linyuan Lu, R. P. Anstee
Publication date: 14 August 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Abstract: Let be a given integer. Let be a family of subsets of . Assume that for every pair of disjoint sets with , there do not exist sets in where subsets of contain and are disjoint from and subsets of contain and are disjoint from . We show that is . Our main new ingredient is allowing, during the inductive proof, multisets of subsets of where the multiplicity of a given set is bounded by . We use a strong stability result of Anstee and Keevash. This is further evidence for a conjecture of Anstee and Sali. These problems can be stated in the language of matrices Let denote copies of the matrix concatenated together. We have established the conjecture for those configurations for any (0,1)-matrix .
Full work available at URL: https://arxiv.org/abs/1305.0603
Recommendations
traceextremal set theoryforbidden configurationsmultiset\((0,1)\)-matricesextremal hypergraphssubhypergraph
Cites Work
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- A combinatorial problem; stability and order for models and theories in infinitary languages
- On the density of families of sets
- Pairwise intersections and forbidden configurations
- Forbidden submatrices
- Bounding one-way differences
- A survey of forbidden configuration results
- Small forbidden configurations. IV: The 3 rowed case
- Forbidden configurations, discrepancy and determinants
- Unavoidable traces of set systems
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Repeated columns and an old chestnut
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396909)