scientific article; zbMATH DE number 795114
From MaRDI portal
Publication:4845263
Recommendations
Cited in
(37)- On minimum \(k\)-modal partitions of permutations
- Sequential selection of an increasing sequence from a multidimensional random sample.
- The symmetry in the martingale inequality
- The matching, birthday and the strong birthday problem: a contemporary review
- The asymptotics of monotone subsequences of involutions
- Fast computation of a longest increasing subsequence and application
- Combinatorial generation via permutation languages. II. Lattice congruences
- Representing point sets on the plane as permutations
- A strengthening of the Erdős-Szekeres theorem
- Nonexistence of bigeodesics in planar exponential last passage percolation
- Fast and longest rollercoasters
- Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
- Three-monotone interpolation
- Higher-order Erdős-Szekeres theorems
- Bounds on half graph orders in powers of sparse graphs
- Empirical scaling of the length of the longest increasing subsequences of random walks
- The parallel stack loading problem to minimize blockages
- Enumeration formulæ for pattern restricted Stirling permutations
- Monotone subsequences in high-dimensional permutations
- Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1
- Erdős-Szekeres tableaux
- On increasing subsequences of minimal Erdős-Szekeres permutations
- Rollercoasters and caterpillars
- Monotone subsets in lattices and the Schensted shape of a Sós permutation
- Fast and longest rollercoasters
- Rollercoasters: Long Sequences without Short Runs
- On Erdős' theorem for monotonic subsequences
- Decomposing Random Permutations into Order-Isomorphic Subpermutations
- Erdős-Szekeres theorem for multidimensional arrays
- A positive fraction Erdős-Szekeres theorem and its applications
- Ramsey numbers of cliques versus monotone paths
- Discrete geometry. Abstracts from the workshop held January 21--26, 2024
- Exponential Erdős-Szekeres theorem for matrices
- Online Ramsey numbers of ordered paths and cycles
- On increasing sequences formed by points from a random finite subset of a hypercube
- A linear time approximation algorithm for permutation flow shop scheduling
- Semi-algebraic Ramsey numbers
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4845263)
