Abstract
For \(k \ge 2\), an ordered k-uniform hypergraph \(\mathcal {H}=(H,<)\) is a k-uniform hypergraph H together with a fixed linear ordering < of its vertex set. The ordered Ramsey number \(\overline{R}(\mathcal {H},\mathcal {G})\) of two ordered k-uniform hypergraphs \(\mathcal {H}\) and \(\mathcal {G}\) is the smallest such that every red-blue coloring of the hyperedges of the ordered complete k-uniform hypergraph \(\mathcal {K}^{(k)}_N\) contains a blue copy of \(\mathcal {H}\) or a red copy of \(\mathcal {G}\).
The ordered Ramsey numbers are quite extensively studied for ordered graphs, but little is known about ordered hypergraphs of higher uniformity. We provide some of the first nontrivial estimates on ordered Ramsey numbers of ordered 3-uniform hypergraphs. In particular, we prove that for all and for every ordered 3-uniform hypergraph \(\mathcal {H}\) on n vertices with maximum degree d and with interval chromatic number 3 there is an \(\varepsilon =\varepsilon (d)>0\) such that \(\overline{R}(\mathcal {H},\mathcal {H}) \le 2^{O(n^{2-\varepsilon })}\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Balko, M.: Ramsey numbers and monotone colorings. J. Comb. Theory Ser. A 163, 34–58 (2019)
Balko, M., Cibulka, J., Král, K., Kynčl, J.: Ramsey numbers of ordered graphs. Electron. J. Comb. 49, P1-16 (2020)
Balko, M., Jelínek, V., Valtr, P.: On ordered Ramsey numbers of bounded-degree graphs. J. Comb. Theory Ser. B 134, 179–202 (2019)
Chvátal, V., Rödl, V., Szemerédi, E., Trotter, W.T., Jr.: The Ramsey number of a graph with bounded maximum degree. J. Comb. Theory Ser. B 34(3), 239–243 (1982)
Conlon, D., Fox, J., Lee, C., Sudakov, B.: Ordered Ramsey numbers. J. Comb. Theory Ser. B 122, 353–383 (2017)
Conlon, D., Fox, J., Sudakov, B.: Ramsey numbers of sparse hypergraphs. Random Struct. Algorithms 35(1), 1–14 (2009)
Conlon, D., Fox, J., Sudakov, B.: Hypergraph Ramsey numbers. J. Am. Math. Soc. 23(1), 247–266 (2010)
Conlon, D., Fox, J., Sudakov, B.: Large almost monochromatic subsets in hypergraphs. Israel J. Math. 181(1), 423–432 (2011). https://doi.org/10.1007/s11856-011-0016-6
Conlon, D., Fox, J., Sudakov, B.: Erdős-Hajnal-type theorems in hypergraphs. J. Comb. Theory Ser. B 102(5), 1142–1154 (2012)
Conlon, D., Fox, J., Sudakov, B.: Recent developments in graph Ramsey theory. Surv. Comb. London Math. Soc. Lect. Note Ser. 424, 49–118 (2015)
Cooley, O., Fountoulakis, N., Kühn, D., Osthus, D.: Embeddings and Ramsey numbers of sparse \(k\)-uniform hypergraphs. Combinatorica 29(3), 263–297 (2009). https://doi.org/10.1007/s00493-009-2356-y
Erdős, P.: Some remarks on the theory of graphs. Bull. Am. Math. Soc. 53(4), 292–294 (1947)
Erdős, P.: On extremal problems of graphs and generalized graphs. Israel J. Math. 2(3), 183–190 (1964). https://doi.org/10.1007/BF02759942
Erdős, P., Hajnal, A., Rado, R.: Partition relations for cardinal numbers. Acta Math. Acad. Sci. Hungar. 16, 93–196 (1965). https://doi.org/10.1007/BF01886396
Erdős, P., Szekeres, G.: A combinatorial problem in geometry. Compositio mathematica 2, 463–470 (1935)
Fox, J., He, X.: Independent sets in hypergraphs with a forbidden link. ArXiv preprint arXiv:1909.05988 (2019)
Fox, J., Pach, J., Sudakov, B., Suk, A.: Erdős-Szekeres-type theorems for monotone paths and convex bodies. Proc. Lond. Math. Soc. 105(5), 953–982 (2012)
Ishigami, Y.: Linear Ramsey numbers for bounded degree hypergrahps. Electron. Notes Discret. Math. 29, 47–51 (2007)
Li, Y., Zang, W.: Ramsey numbers involving large dense graphs and bipartite Turán numbers. J. Comb. Theory Ser. B 87(2), 280–288 (2003)
Moshkovitz, G., Shapira, A.: Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem. Adv. Math. 262, 1107–1129 (2014)
Nagle, B., Olsen, S., Rödl, V., Schacht, M.: On the Ramsey number of sparse 3-graphs. Graphs Comb. 24(3), 205–228 (2008). https://doi.org/10.1007/s00373-008-0784-x
Nikiforov, V.: Complete \(r\)-partite subgraphs of dense \(r\)-graphs. Discret. Math. 309(13), 4326–4331 (2009)
Pach, J., Tardos, G.: Forbidden paths and cycles in ordered graphs and matrices. Israel J. Math. 155(1), 359–380 (2006). https://doi.org/10.1007/BF02773960
Acknowledgment
The first author was supported by the grant no. 18-13685Y of the Czech Science Foundation (GAČR) and by the Center for Foundations of Modern Computer Science (Charles University project UNCE/SCI/004). This article is part of a project that has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 810115).
The second author was supported by the Hungarian National Research, Development and Innovation Office – NKFIH under the grant SNN 129364, KH 130371 and FK 132060 by the János Bolyai Research Fellowship of the Hungarian Academy of Sciences and by the New National Excellence Program under the grant number ÚNKP-20-5-BME-45.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Balko, M., Vizer, M. (2021). On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs. In: Nešetřil, J., Perarnau, G., Rué, J., Serra, O. (eds) Extended Abstracts EuroComb 2021. Trends in Mathematics(), vol 14. Birkhäuser, Cham. https://doi.org/10.1007/978-3-030-83823-2_23
Download citation
DOI: https://doi.org/10.1007/978-3-030-83823-2_23
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-030-83822-5
Online ISBN: 978-3-030-83823-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)