On ordered Ramsey numbers of tripartite 3-uniform hypergraphs
From MaRDI portal
Publication:6604686
DOI10.1007/978-3-030-83823-2_23MaRDI QIDQ6604686
Publication date: 13 September 2024
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
- A combinatorial problem in geometry.
- 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
- 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
This page was built for publication: On ordered Ramsey numbers of tripartite 3-uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604686)
