Erdős-Szekeres type theorems for ordered uniform matchings
From MaRDI portal
(Redirected from Publication:6652096)
Recommendations
Cites work
- A multidimensional generalization of the Erdős-Szekeres lemma on monotone subsequences.
- A unified Erdős-Pósa theorem for constrained cycles
- Concentration for Independent Permutations
- Concentration for locally acting permutations
- Concentration of measure and isoperimetric inequalities in product spaces
- Erdős-Szekeres theorem for k-flats
- Erdős-Szekeres theorem for cyclic permutations
- Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1
- Erdős-Szekeres-type theorems for monotone paths and convex bodies
- EXTREMAL THEORY OF ORDERED GRAPHS
- Higher-order Erdős-Szekeres theorems
- scientific article; zbMATH DE number 1246230 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 5204618 (Why is no real title available?)
- scientific article; zbMATH DE number 3019031 (Why is no real title available?)
- Lower bounds for multicolor Ramsey numbers
- Monochromatic spanning trees and matchings in ordered complete graphs
- Order-isomorphic twins in permutations
- Ordered Ramsey numbers
- Ordered unavoidable sub-structures in matchings and random matchings
- Patterns in ordered (random) matchings
- Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
- Random Intervals
- The asymptotics of monotone subsequences of involutions
Cited in
(3)
This page was built for publication: Erdős-Szekeres type theorems for ordered uniform matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652096)