An Infinite Antichain of Planar Tanglegrams

被引:0
|
作者
Czabarka, Eva [1 ,2 ]
Smith, Stephen J. [1 ]
Szekely, Laszlo A. [1 ,2 ]
机构
[1] Univ South Carolina, Dept Math, Columbia, SC 29208 USA
[2] Univ Johannesburg, Dept Math & Appl Math, Johannesburg, South Africa
基金
美国国家科学基金会;
关键词
Binary tree; Caterpillar; Induced subtree; Tanglegram; Planar tanglegram; Induced subtanglegram; Permutation; Permutation pattern; Partial order; Well-quasi-ordering; Antichain; GRAPH MINORS; TREES;
D O I
10.1007/s11083-021-09563-6
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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. Bona, 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 Bona (Electr. J. Comb. 7, N2, 2000).
引用
收藏
页码:45 / 54
页数:10
相关论文
共 50 条
  • [41] Antichain toggling and rowmotion
    Joseph, Michael
    ELECTRONIC JOURNAL OF COMBINATORICS, 2019, 26 (01):
  • [42] The incipient infinite cluster of the uniform infinite half-planar triangulation
    Richier, Loic
    ELECTRONIC JOURNAL OF PROBABILITY, 2018, 23
  • [43] Tanglegrams for rooted phylogenetic trees and networks
    Scornavacca, Celine
    Zickmann, Franziska
    Huson, Daniel H.
    BIOINFORMATICS, 2011, 27 (13) : I248 - I256
  • [44] Preemptive scheduling and antichain polyhedra
    Quilliot, Alain
    DISCRETE APPLIED MATHEMATICS, 2008, 156 (17) : 3267 - 3275
  • [45] Finite Antichain Cutsets in Posets
    李伯渝
    Acta Mathematica Sinica, 1991, (01) : 51 - 61
  • [46] An Antichain Algorithm for LTL Realizability
    Filiot, Emmanuel
    Jin, Naiyong
    Raskin, Jean-Francois
    COMPUTER AIDED VERIFICATION, PROCEEDINGS, 2009, 5643 : 263 - 277
  • [47] Posets with the Maximal Antichain Property
    Bill Sands
    Order, 2010, 27 : 1 - 8
  • [48] Antichain Algorithms for Finite Automata
    Doyen, Laurent
    Raskin, Jean-Francois
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PROCEEDINGS, 2010, 6015 : 2 - +
  • [49] ONE-WAY INFINITE HAMILTONIAN PATHS IN INFINITE MAXIMAL PLANAR GRAPHS
    JUNG, HO
    ABHANDLUNGEN AUS DEM MATHEMATISCHEN SEMINAR DER UNIVERSITAT HAMBURG, 1994, 64 : 141 - 150
  • [50] Infinite paths in planar graphs III, 1-way infinite paths
    Yu, XX
    JOURNAL OF GRAPH THEORY, 2006, 51 (03) : 175 - 198