Abstract
Contrary to the expectation arising from the tanglegram Kuratowski theorem of Czabarka et al. (SIAM J. Discrete Math. 31(3), 1732–1750, 2017), we construct an infinite antichain of planar tanglegrams with respect to the induced subtanglegram partial order. R.E. Tarjan, R. Laver, D.A. Spielman and M. Bóna, and possibly others, showed that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain, i.e., there exists an infinite collection of permutations, such that none of them contains another as a pattern. Our construction adds a twist to the construction of Spielman and Bóna (Electr. J. Comb. 7, N2, 2000).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
