Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems

From MaRDI portal
Publication:5366963

DOI10.1017/S0963548317000013zbMATH Open1371.05301arXiv1408.4093OpenAlexW2964123780MaRDI QIDQ5366963FDOQ5366963


Authors: Abhishek Methuku, Dömötör Pálvölgyi Edit this on Wikidata


Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Abstract: We prove that for every poset P, there is a constant C such that the size of any family of subsets of [n] that does not contain P as an induced subposet is at most , settling a conjecture of Katona, and Lu and Milans. We obtain this bound by establishing a connection to the theory of forbidden submatrices and then applying a higher dimensional variant of the Marcus-Tardos theorem, proved by Klazar and Marcus. We also give a new proof of their result.


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




Recommendations




Cites Work


Cited In (23)





This page was built for publication: Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5366963)