Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
From MaRDI portal
Publication:2251909
DOI10.1016/j.aim.2014.06.008zbMath1295.05255arXiv1206.4001OpenAlexW1990782466MaRDI QIDQ2251909
Publication date: 15 July 2014
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.4001
Combinatorial aspects of partitions of integers (05A17) Hypergraphs (05C65) Combinatorics of partially ordered sets (06A07) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (26)
On the Erdős-Szekeres convex polygon problem ⋮ Erdős-Szekeres without induction ⋮ Sequences, q-Multinomial Identities, Integer Partitions with Kinds, and Generalized Galois Numbers ⋮ Off-diagonal hypergraph Ramsey numbers ⋮ The Erdős-Hajnal hypergraph Ramsey problem ⋮ Ramsey numbers of semi-algebraic and semi-linear hypergraphs ⋮ Ordered Ramsey numbers of loose paths and matchings ⋮ On the number of high‐dimensional partitions ⋮ Bounds on the number of higher-dimensional partitions ⋮ Approximating the Rectilinear Crossing Number ⋮ A positive fraction Erdős-Szekeres theorem and its applications ⋮ Ramsey numbers and monotone colorings ⋮ Ramsey numbers of ordered graphs ⋮ Two extensions of the Erdős-Szekeres problem ⋮ Ordered Ramsey numbers ⋮ On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness ⋮ Ramsey numbers of ordered graphs ⋮ Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems ⋮ On the geometric Ramsey number of outerplanar graphs ⋮ Hypergraph Ramsey numbers: tight cycles versus cliques ⋮ A simple upper bound on the number of antichains in \([t^n\)] ⋮ Ramsey numbers for partially-ordered sets ⋮ Increasing Hamiltonian paths in random edge orderings ⋮ Minimal ordered Ramsey graphs ⋮ Ramsey numbers of interval 2-chromatic ordered graphs ⋮ On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs
Cites Work
- Maximal probabilities of convolution powers of discrete uniform distributions
- Some applications of algebra to combinatorics
- Coherence and enumeration of tilings of 3-zonotopes
- Some asymptotic formulas for lattice paths
- Higher-order Erdős-Szekeres theorems
- A decomposition theorem for partially ordered sets
- Entropy, independent sets and antichains: A new approach to Dedekind’s problem
- Erdős-Szekeres-type theorems for monotone paths and convex bodies
- A Simple Proof of a Theorem of Erdös and Szekeres*
- A Course in Enumeration
- Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
- On Dedekind's Problem: The Number of Isotone Boolean Functions. II
- The Erdos-Szekeres problem on points in convex position – a survey
- Entropy and enumeration of Boolean functions
- On Dedekind's Problem: The Number of Monotone Boolean Functions
- Some Combinatorial Theorems on Monotonicity
- A Dual of Dilworth's Decomposition Theorem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
