Constructions and nonexistence results for suitable sets of permutations

DOI10.1016/j.jcta.2016.12.006zbMath1355.05002arXiv1603.02807OpenAlexW2962835024MaRDI QIDQ507826

Jonathan Jedwab, Justin H. C. Chan

Publication date: 9 February 2017

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

nonexistenceRamsey's theoremextremal problemconstructionsuitable arraysuitable core

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Ramsey theory (05D10)

Related Items

Suitable sets of permutations, packings of triples, and Ramsey's theorem ⋮ Better bounds for poset dimension and boxicity

Cites Work

• Unnamed Item
• Unnamed Item
• A survey of binary covering arrays
• Hadamard matrices and their applications: progress 2007--2010
• On the dimensions of ordered sets of bounded degree
• On the order dimension of 1-sets versus \(k\)-sets
• A review of the available construction methods for Golomb rulers
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Suitable Permutations, Binary Covering Arrays, and Paley Matrices
• On Orthogonal Matrices
• Minimal scrambling sets of simple orders
• Concerning a Certain Set of Arrangements
• On a Problem of Sidon in Additive Number Theory, and on some Related Problems