Better upper bounds on the Füredi-Hajnal limits of permutations

DOI10.1137/1.9781611974782.150zbMath1410.05014arXiv1607.07491OpenAlexW2558067245MaRDI QIDQ4575898

Jan Kynčl, Josef Cibulka

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Permutations, words, matrices (05A05)

Related Items (4)

Almost all permutation matrices have bounded saturation functions ⋮ Twin-width II: small classes ⋮ Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations ⋮ Universality of random permutations

This page was built for publication: Better upper bounds on the Füredi-Hajnal limits of permutations