Supertrees

DOI10.37236/8971zbMath1439.05049arXiv1908.03197OpenAlexW4244109890MaRDI QIDQ2181994

Noah Kravitz, Colin Defant, Ashwin Sah

Publication date: 20 May 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

permutation patterns\(k\)-superpermutation\(k\)-universal permutation

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Permutations, words, matrices (05A05) Distance in graphs (05C12)

Related Items

Tree series and pattern avoidance in syntax trees

Cites Work

• Non-contiguous pattern avoidance in binary trees
• Asymptotically optimal induced universal graphs
• Patterns in permutations and words.
• Pattern avoidance in labelled trees
• Induced-universal graphs for graphs with bounded maximum degree
• On induced-universal graphs for the class of bounded-degree graphs
• Asymptotic bounds for permutations containing many different patterns
• Universal cycles for permutations
• Universal caterpillars
• On graphs which contain all small trees
• On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
• Universal layered permutations
• Polyurethane toggles
• Patterns in treeshelves
• Dense packing of patterns in a permutation
• Noncontiguous pattern containment in binary trees
• Combinatorics of Permutations
• Adjacency Labeling Schemes and Induced-Universal Graphs
• Postorder Preimages
• Universal graphs and induced-universal graphs
• Patterns and pattern-matching in trees: An analysis
• On Universal Graphs for Spanning Trees
• Containing All Permutations
• Pattern Avoidance in Ternary Trees
• Universal graphs and universal functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item