Saturation problems in the Ramsey theory of graphs, posets and point sets

DOI10.1016/j.ejc.2021.103321zbMath1466.05210arXiv2004.06097OpenAlexW3135303697MaRDI QIDQ2033927

Balázs Keszegh, Gábor Damásdi, Oscar Zamora, David Malec, Casey Tompkins, Zhiyu Wang

Publication date: 18 June 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Erdős-Szekeres theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorics of partially ordered sets (06A07) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items

Almost all permutation matrices have bounded saturation functions ⋮ Two problems in graph Ramsey theory ⋮ Saturation of Ordered Graphs ⋮ Saturation Problems about Forbidden 0-1 Submatrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Permutations with short monotone subsequences
• On maximal intersecting families of finite sets
• A note on Ramsey numbers
• Erdős-Szekeres theorem for cyclic permutations
• The saturation number of induced subposets of the Boolean lattice
• A decomposition theorem for partially ordered sets
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Saturated graphs with minimal number of edges
• Minimum saturated families of sets
• The Ramsey number R(3, t) has order of magnitude t²/log t
• Cycle-Saturated Graphs with Minimum Number of Edges
• The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
• On the Erdős-Szekeres convex polygon problem
• A Problem in Graph Theory
• Dynamic concentration of the triangle-free process
• On the number of edge-disjoint triangles in \(K_4\)-free graphs