A note on universal and canonically coloured sequences

DOI10.1017/S0963548309009961MaRDI QIDQ3552497zbMATH OpenOpenAlexFDO

Authors Andrzej Dudek, Peter Frankl, Vojtěch Rödl

Publication date 22 April 2010

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

Full work available at URL https://doi.org/10.1017/s0963548309009961

zbMATH Keywords

\(t\)-universal sequenceRamsey-type problem

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Formal languages and automata (68Q45) Combinatorics in computer science (68R05)

Recommendations

• scientific article; zbMATH DE number 1811347
• Universality of random permutations
• A note on a Ramsey-type problem for sequences
• Universal arrays
• Unordered canonical Ramsey numbers

Cites work

• A lower bound on the length of a sequence containing all permutations as subsequences
• Shortest string containing all permutations
• Shortest string containing all permutations

Cited in

(1)

• A note on a Ramsey-type problem for sequences

This page was built for publication: A note on universal and canonically coloured sequences

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