On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs
From MaRDI portal
Publication:5028353
DOI10.1137/21M1404958zbMath1483.05194MaRDI QIDQ5028353
Publication date: 9 February 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Cites Work
- Large almost monochromatic subsets in hypergraphs
- Erdős-Hajnal-type theorems in hypergraphs
- The Ramsey number of a graph with bounded maximum degree
- Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
- On the Ramsey number of sparse 3-graphs
- Complete \(r\)-partite subgraphs of dense \(r\)-graphs
- Ramsey numbers involving large dense graphs and bipartite Turán numbers
- On ordered Ramsey numbers of bounded-degree graphs
- Ramsey numbers and monotone colorings
- Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
- On extremal problems of graphs and generalized graphs
- Forbidden paths and cycles in ordered graphs and matrices
- 3-uniform hypergraphs of bounded degree have linear Ramsey numbers
- Erdős-Szekeres-type theorems for monotone paths and convex bodies
- Recent developments in graph Ramsey theory
- Linear Ramsey Numbers for Bounded-Degree Hypergrahps
- Hypergraph Ramsey numbers
- Independent sets in hypergraphs with a forbidden link
- Partition relations for cardinal numbers
- Some remarks on the theory of graphs
- Ordered Ramsey numbers
- Ramsey numbers of sparse hypergraphs
- Ramsey numbers of ordered graphs
