On the abstract chromatic number and its computability for finitely axiomatizable theories

Alon, 2016, Many T copies in H-free graphs, J. Comb. Theory, Ser. B, 121, 146, 10.1016/j.jctb.2016.03.004 Brass, 2003, A Turán-type extremal theory of convex geometric graphs, vol. 25, 275 Bodirsky, 2015, Ramsey classes: examples and constructions, vol. 424, 1 Balko, 2020, Edge-ordered Ramsey numbers, Eur. J. Comb., 87, 10.1016/j.ejc.2020.103100 Conlon, 2017, Ordered Ramsey numbers, J. Comb. Theory, Ser. B, 122, 353, 10.1016/j.jctb.2016.06.007 Coregliano, 2020, Semantic limits of dense combinatorial objects, Usp. Mat. Nauk, 75, 45 Cox, 2016, Ordered Ramsey numbers of loose paths and matchings, Discrete Math., 339, 499, 10.1016/j.disc.2015.09.026 Cox, 2018, Ramsey numbers for partially-ordered sets, Order, 35, 557, 10.1007/s11083-017-9449-9 Erdős, 1964, On the representation of directed graphs as unions of orderings, Magy. Tud. Akad. Mat. Kut. Intéz. Közl., 9, 125 Erdős, 1962, On the number of complete subgraphs contained in certain graphs, Magy. Tud. Akad. Mat. Kut. Intéz. Közl., 7, 459 Erdös, 1946, On the structure of linear graphs, Bull. Am. Math. Soc., 52, 1087, 10.1090/S0002-9904-1946-08715-7 Erdős, 1966, A limit theorem in graph theory, Studia Sci. Math. Hung., 1, 51 Gerbner, 2019, Edge ordered Turán problems, Acta Math. Univ. Comen. (N. S.), 88, 717 Graham, 1990, Ramsey Theory, 10.1038/scientificamerican0790-112 Nešetřil, 1989, The partite construction and Ramsey set systems, vol. 75, 327 Pach, 2006, Forbidden paths and cycles in ordered graphs and matrices, Isr. J. Math., 155, 359, 10.1007/BF02773960 Ramsey, 1929, On a problem of formal logic, Proc. Lond. Math. Soc. (2), 30, 264 Stearns, 1959, The voting problem, Am. Math. Mon., 66, 761, 10.1080/00029890.1959.11989405 Tardos, 2019, Extremal theory of vertex or edge ordered graphs, vol. 456, 221 Turán, 1941, Eine Extremalaufgabe aus der Graphentheorie, Mat. Fiz. Lapok, 48, 436