Ordered unavoidable sub-structures in matchings and random matchings
From MaRDI portal
Publication:6499978
DOI10.37236/11932MaRDI QIDQ6499978
Jarosław Grytczuk, Andrzej Dudek, Andrzej Ruciński
Publication date: 10 May 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1
- Dyck paths and pattern-avoiding matchings
- On the realization of double occurrence words
- Probabilistic methods for algorithmic discrete mathematics
- The asymptotics of monotone subsequences of involutions
- A regularity lemma and twins in words
- Variations on twins in permutations
- Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
- A unified Erdős-Pósa theorem for constrained cycles
- Higher-order Erdős-Szekeres theorems
- Distribution of crossings, nestings and alignments of two edges in matchings and partitions
- A Multidimensional Generalization of the Erdős–Szekeres Lemma on Monotone Subsequences
- Self-Similarity of Graphs
- Erdős-Szekeres-type theorems for monotone paths and convex bodies
- Random Intervals
- Extremal problems for convex geometric hypergraphs and ordered hypergraphs
- EXTREMAL THEORY OF ORDERED GRAPHS
- Order-Isomorphic Twins in Permutations
- Catalan Numbers
- Ordered Ramsey numbers
- Ramsey numbers of ordered graphs
- Erdős-Szekeres theorem for \(k\)-flats
- Patterns in ordered (random) matchings
- Erdős-Szekeres theorem for multidimensional arrays
This page was built for publication: Ordered unavoidable sub-structures in matchings and random matchings
