Universal arrays
DOI10.1016/j.disc.2021.112626zbMath1473.05210arXiv2001.05767OpenAlexW4200118163MaRDI QIDQ2231736
Daniel A. Quiroz, Matías Pavez-Signé, Nicolás Sanhueza-Matamala
Publication date: 30 September 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.05767
Random graphs (graph-theoretic aspects) (05C80) Combinatorics on words (68R15) Permutations, words, matrices (05A05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- Twins in words and long common subsequences in permutations
- An upper bound on the number of high-dimensional permutations
- Asymptotically optimal induced universal graphs
- Graphs which contain all small graphs
- On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
- A regularity lemma and twins in words
- Lower bounds for superpatterns and universal sequences
- Expected length of the longest common subsequence for large alphabets
- Universality of random permutations
- Longest common subsequences of two random sequences
- Ramsey properties of orientations of graphs
- Expected Number of Distinct Subsequences in Randomly Generated Binary Strings
- Monotone Subsequences in High-Dimensional Permutations
- Induced Universal Hypergraphs
- Longest Common Subsequences in Sets of Words
- On minimal n-universal graphs
- Universal graphs and universal functions
- Concentration of Measure for the Analysis of Randomized Algorithms
- Quasi-random words and limits of word sequences
This page was built for publication: Universal arrays
