Ackerman, N. [2012] On n-cardinal spectra of ultrahomogeneous theories, preprint.Google Scholar

Akhtar, R. and H. Lachlan, A. [1995] On countable homogeneous 3-hypergraphs, Archive for Mathematical Logic, vol. 34, pp. 331–344.Google Scholar

Amato, D., Cherlin, G., and D. Macpherson, H. [2021] Metrically homogeneous graphs of diameter 3, Journal of Mathematical Logic, vol. 21, no. 1, pp. 1–106, paper No. 2050020.CrossRefGoogle Scholar

Aranda, A., Bradley-Williams, D., K. Hng, E., Hubička, J., Karamanlis, M., Kompatscher, M., Konečný, M., and Pawliuk, M. [2021] Completing graphs to metric spaces, Contributions to Discrete Mathematics, vol. 16, pp. 71–89, e-print arXiv:1706.00295 [math.CO], 2017.Google Scholar

Aranda, A., Bradley-Williams, D., Hubička, J., Karamanlis, M., Kompatscher, M., Konečný, M., and Pawliuk, M. [2017] Ramsey expansions of metrically homogeneous graphs, e-print arXiv:1707.02612 [math.CO].Google Scholar

Baginski, P. [2009] Stableℵ₀-Categorical Algebraic Structures, Ph.D. thesis, University of California, Berkeley, Ann Arbor, MI, 132 pp.Google Scholar

Baur, W., Cherlin, G., and Macintyre, A. [1979] Totally categorical groups and rings, Journal of Algebra, vol. 57, pp. 407–440.Google Scholar

Ben Yaacov, I., Melleray, J., and Tsankov, T. [2017] Metrizable universal minimal flows of Polish groups have a comeagre orbit, Geometric and Functional Analysis, vol. 27, no. 1, pp. 67–77.CrossRefGoogle Scholar

Bishnoi, A. and De Bruyn, B. [2016] On semi-finite hexagons of order (2, t) containing a subhexagon, Annals of Combinatorics, vol. 20, no. 3, pp. 433–452. 253Google Scholar

Bodirsky, M. [2015] The complexity of constraint satisfaction problems, 32nd International Symposium on Theoretical Aspects of Computer Science (Wadern), LIPIcs: Leibniz International Proceedings in Informatics, Schloss Dagstuhl, vol. 30, Leibniz-Zentrum für Informatik, pp. 2–9. [2021] Complexity of Infinite-Domain Constraint Satisfaction, Lecture Notes in Logic, vol. 52, Cambridge University Press, Cambridge; Association for Symbolic Logic, Ithaca, NY.Google Scholar

Bodirsky, M., Knäuer, S., and Rydval, J. [2021] Amalgamation is PSPACE-hard, e-print arXiv:2108.00452 [cs.LO]; revised.Google Scholar

Bodirsky, M. and Pinsker, M. [2011] Reducts of Ramsey structures, Model Theoretic Methods in Finite Combinatorics (Grohe and J. A. Makowsky, M., editors), Contemporary Mathematics, no. 558, American Mathematical Society, Providence, RI, pp. 489–519.Google Scholar

Bodirsky, M., Pinsker, M., and Pongrácz, A. [2015] The 42 reducts of the random ordered graph, Proceedings of the London Mathematical Society. Third Series, vol. 111, no. 3, pp. 591–632.Google Scholar

Bodirsky, M., Pinsker, M., and Tsankov, T. [2013] Decidability of definability, The Journal of Symbolic Logic, vol. 78, no. 4, pp. 1036–1054.Google Scholar

Bodirsky, M., Rydval, J., and Schrottenloher, A. [2021] Universal Horn sentences and the joint embedding property, e-print arXiv:2104.11123 [cs.LO].Google Scholar

Bonato, A. and Delić, D. [1997/98] The model companion of width-two orders, Order, vol. 14, pp. 87–99.Google Scholar

Braunfeld, S. [2016] The lattice of definable equivalence relations in homogeneous n-dimensional permutation structures, Electronic Journal of Combinatorics, vol. 23, no. 4, paper 44, 24 pp. [2019] The undecidability of joint embedding and joint homomorphism for hereditary graph classes, Discrete Mathematics & Theoretical Computer Science, vol. 21, no. 2, paper 9, 17 pp.CrossRefGoogle Scholar

J. Cameron, P. [1990] Oligomorphic Permutation Groups, London Mathematical Society Lecture Note Series 152, Cambridge University Press. [1998] A census of infinite distance transitive graphs, Discrete Mathematics, vol. 192, pp. 11–26. [2000] Homogeneous Cayley objects, European Journal of Combinatorics, vol. 21, pp. 745–760, Special volume: Discrete metric spaces (Marseille, 1998). [2002/03] Homogeneous permutations, Electronic Journal of Combinatorics, vol. 9, paper 2, pp. 1–9.Google Scholar

J. Cameron, P. and W. Johnson, K. [1987] An investigation of countable B-groups, Mathematical Proceedings of the Cambridge Philosophical Society, vol. 102, pp. 223–231.CrossRefGoogle Scholar

J. Cameron, P. and M. Vershik, A. [2006] Some isometry groups of the Urysohn space, Annals of Pure and Applied Logic, vol. 143, pp. 70–78.CrossRefGoogle Scholar

Cherlin, G. [1987] Homogeneous directed graphs I. The imprimitive case, Logic Colloquium 1985 (The Paris Logic Group, editor), North-Holland, Amsterdam, pp. 67–88. [1998] The Classification of Countable Homogeneous Directed Graphs and Countable Homogeneous n-Tournaments, Memoirs of the American Mathematical Society, vol. 131, no. 621, xiv+161 pp. [1999] Infinite imprimitive homogeneous 3-edge-colored complete graphs, The Journal of Symbolic Logic, vol. 64, pp. 159–179. [2000] Sporadic homogeneous structures, The Gelfand Mathematical Seminars, 1996–1999, Gelfand Math. Sem., Birkhäuser Boston, Boston, MA, pp. 15–48. [2005] Locally finite generalized quadrangles with at most five points per line, Discrete Mathematics, vol. 291, pp. 73–79. [2011a] Forbidden substructures and combinatorial dichotomies: WQO and universality, Discrete Mathematics, vol. 311, pp. 1543–1584. [2011b] Two problems on homogeneous structures, revisited, Model Theoretic Methods in Finite Combinatorics (Grohe and J. A. Makowsky, M., editors), Contemporary Mathematics, no. 558, American Mathematical Society, Providence, RI, pp. 319–415. [2016] On the relational complexity of a finite permutation group, Journal of Algebraic Combinatorics, vol. 43, pp. 339–374. [2021] Homogeneity and related topics: An extended bibliography, e-print arXiv:2111.15429 [math.LO].Google Scholar

Cherlin, G. and Hrushovski, E. [2003] Finite Structures with Few Types, Annals of Mathematics Studies, vol. 152, Princeton University Press, Princeton, NJ, vi+193 pp.Google Scholar

Cherlin, G., Hubička, J., Konečný, M., and Nešetřil, J. [2021] Ramsey expansions of 3-hypertournaments, Extended Abstracts EuroComb 2021 (Jaroslav Nešetřil, Guillem Perarnau, Juanjo Rué, and Oriol Serra, editors), European Conference on Combinatorics, Graph Theory and Applications, Springer, pp. 696–701.Google Scholar

Cherlin, G., Shelah, S., and Shi, N. [1999] Universal graphs with forbidden subgraphs and algebraic closure, Advances in Applied Mathematics, vol. 22, pp. 454–491.Google Scholar

Cherlin, G. and Tallgren, L. [2007] Universal graphs with a forbidden near-path or 2-bouquet, Journal of Graph Theory, vol. 56, pp. 41–63.Google Scholar

Cherlin, G. and Thomas, S. [2002] Two cardinal properties of homogeneous graphs, The Journal of Symbolic Logic, vol. 67, pp. 217–220.CrossRefGoogle Scholar

Conant, G. [2015] Model Theory and Combinatorics of Homogeneous Metric Spaces, Ph.D. thesis, University of Illinois at Chicago, 288 pp. [2017] Distance structures for generalized metric spaces, Annals of Pure and Applied Logic, vol. 168, no. 3, pp. 622–650. [2019] Extending partial isometries of generalized metric spaces, Fundamenta Mathematicae, vol. 244, no. 1, pp. 1–16.Google Scholar

Coulson, R. [2019] Metrically Homogeneous Graphs: Dynamical Properties of their Automorphism Groups and the Classification of Twists, Ph.D. thesis, Rutgers University.Google Scholar

Covington, J. [1990] Homogenizable relational structures, Illinois Journal of Mathematics, vol. 34, pp. 731–743.Google Scholar

Dalla Volta, F., Gill, N., and Spiga, P. [2018] Cherlin’s conjecture for sporadic simple groups, Pacific Journal of Mathematics, vol. 297, no. 1, pp. 47–66.CrossRefGoogle Scholar

Dolinka, I. and Mašulović, D. [2012] Countable homogeneous linearly ordered posets, European Journal of Combinatorics, vol. 33, pp. 1965–1973.Google Scholar

El-Zahar, M. and Sauer, N. [1991] Ramsey-type properties of relational structures, Discrete Mathematics, vol. 94, pp. 1–10. [1993] On the divisibility of homogeneous directed graphs, Canadian Journal of Mathematics, vol. 45, pp. 284–294.Google Scholar

Evans, D., Hubička, J., Konečný, M., and Nešetřil, J. [2020] EPPA for two-graphs and antipodal metric spaces, Proceedings of the American Mathematical Society, vol. 148, no. 5, pp. 1901–1915.Google Scholar

M. Evans, D., Hubička, J., Konečný, M., and Li, Y. [2019] Simplicity of the automorphism groups of generalised metric spaces, e-print arXiv:1907.13204 [math.GR].Google Scholar

M. Evans, D., Hubička, J., and Nešetřil, J. [2019] Automorphism groups and Ramsey properties of sparse graphs, Proceedings of the London Mathematical Society. Third Series, vol. 119, no. 2, pp. 515–546.CrossRefGoogle Scholar

Even-Zohar, Ch. and Linial, N. [2015] Triply existentially complete triangle-free graphs, Journal of Graph Theory, vol. 78, pp. 305–317.Google Scholar

Felgner, U. [1978] ℵ₀-categorical stable groups, Mathematische Zeitschrift, vol. 160, pp. 27–49.Google Scholar

Gill, N., Hunt, F., and Spiga, P. [2017] Cherlin’s conjecture for almost simple groups of Lie rank 1, e-print arXiv:1705.01344 [math.GR].Google Scholar

Gill, N., Liebeck, M., and Spiga, P. [2021] Cherlin’s conjecture for finite groups of Lie type, e-print arXiv:2106.05154 [math.GR].Google Scholar

Gill, N. and Spiga, P. [2016] Binary permutation groups: Alternating and classical groups, e-print arXiv:1610.01792 [math.GR].Google Scholar

Goldstern, M., Grossberg, R., and Kojman, M. [1996] Infinite homogeneous bipartite graphs with unequal sides, Discrete Mathematics, vol. 149, pp. 69–82.Google Scholar

Ward Henson, C. [1971] A family of countable homogeneous graphs, Pacific Journal of Mathematics, vol. 38, pp. 69–83.Google Scholar

Hrushovski, E. [2020] Definability patterns and their symmetries, Preprint.Google Scholar

Hubička, J. [2019] Structural Ramsey theory and the extension property for partial automorphisms, Introduction to habilitation, 35 pp.Google Scholar

Hubička, J., Konečný, M., and Nešetřil, J. [2020a] Semigroup-valued metric spaces: Ramsey expansions and EPPA, in preparation. [2020b] All those EPPA classes (Strengthenings of the Herwig-Lascar theorem), e-print, arXiv:1902.03855 [math.CO]. v2, 2020.Google Scholar

Hubička, J. and Nešetřil, J. [2019] All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms), Advances in Mathematics, vol. 356, pp. 106791, 89.Google Scholar

Junker, M. and Ziegler, M. [2008] The 116 reducts of , The Journal of Symbolic Logic, vol. 73, pp. 861–884.Google Scholar

Kantor, W. [1972] k-Homogeneous groups, Mathematische Zeitschrift, vol. 124, pp. 261–265.Google Scholar

Kechris, A., Pestov, V., and Todorcevic, S. [2005] Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups, Geometric and Functional Analysis, vol. 15, pp. 106–189.Google Scholar

Kechris, A. and Rosendal, C. [2007] Turbulence, amalgamation, and generic automorphisms of homogeneous structures, Proceedings of the London Mathematical Society (3), vol. 94, pp. 302–350.Google Scholar

Komjáth, P. and Pach, J. [1991] Universal elements and the complexity of certain classes of infinite graphs, Discrete Mathematics, vol. 95, pp. 255–270.Google Scholar

Konečný, M. [2019a] Combinatorial properties of metrically homogeneous graphs, Bachelor’s thesis, Charles University, Prague. [2019b] Semigroup-valued metric spaces, Master’s thesis, Charles University, Prague. [2020] Extending partial isometries of antipodal graphs, Discrete Mathematics, vol. 343, no. 1, pp. 111633, 13.Google Scholar

Koponen, V. [2016] Binary simple homogeneous structures are supersimple with finite rank, Proceedings of the American Mathematical Society, vol. 144, no. 4, pp. 1745–1759. [2017] Binary primitive homogeneous simple structures, The Journal of Symbolic Logic, vol. 82, no. 1, pp. 183–207.CrossRefGoogle Scholar

H. Lachlan, A. [1984] Countable homogeneous tournaments, Transactions of the American Mathematical Society, vol. 284, pp. 431–461. [1986] Binary homogeneous structures II, Proceedings of the London Mathematical Society, vol. 52, pp. 412–426. [ca. 1982] Verification of the classification of stable homogeneous 3-graphs, undated preprint.Google Scholar

Li, Y. [2019] Automorphism groups of homogeneous structures with stationary weak independence relations, e-print arXiv:1911.08540 [math.GR].Google Scholar

Linman, J. and Pinsker, M. [2015] Permutations on the random permutation, The Electronic Journal of Combinatorics, vol. 22, no. 2, paper 54, 22 pp.CrossRefGoogle Scholar

D. Macpherson, H. [1986] Homogeneity in infinite permutation groups, Periodica Mathematica Hungarica, vol. 17, pp. 211–233. [1991] Finite axiomatizability and theories with trivial algebraic closure, Notre Dame Journal of Formal Logic, vol. 32, pp. 188–192. [2011] A survey of homogeneous structures, Discrete Mathematics, vol. 131, pp. 1599–1634.Google Scholar

D. Macpherson, H. and Tent, K. [2011] Simplicity of some automorphism groups, Journal of Algebra, vol. 342, pp. 40–52.Google Scholar

D. Mazurov, V. and I. Khukhro, E. [2014] Unsolved problems in group theory. the Kourovka notebook. no. 18, e-print, arXiv:1401.0300 [math.GR].Google Scholar

Melleray, J., Nguyen Van Thé, L., and Tsankov, T. [2016] Polish groups with metrizable universal minimal flows, International Mathematics Research Notices. IMRN, no. 5, pp. 1285–1307.Google Scholar

Moss, L. [1992] Distanced graphs, Discrete Mathematics, vol. 102, pp. 287–305.Google Scholar

Nešetřil, J. [1979] Amalgamation of graphs and its applications, Second International Conference on Combinatorial Mathematics (New York, 1978) (New York), Annals of New York Academy of Sciences, vol. 319, New York Academy of Sciences, pp. 415–428.Google Scholar

Palacín, D. [2017] Generalized amalgamation and homogeneity, The Journal of Symbolic Logic, vol. 82, no. 4, pp. 1409–1421.Google Scholar

Rubin, M. [1994] On the reconstruction of ℵ₀-categorical structures from their automorphism groups, Proceedings of the London Mathematical Society, vol. 69, pp. 225–249.Google Scholar

Ruškuc, N. [2005] Decidabilty questions for pattern avoidance classes of permutations, Talk at Gainesville (slides).Google Scholar

Saracino, D. [1999] On a combinatorial problem from the model theory of wreath products. I, II, Journal of Combinatorial Theory Series A, vol. 86, pp. 281–305, 306–322. [2000] On a combinatorial problem from the model theory of wreath products. III, Journal of Combinatorial Theory Series A, vol. 89, pp. 231–269.Google Scholar

Simon, P. [2021] NIP ω-categorical structures: the rank 1 case, e-print arXiv:180 7.07102 [math.LO].Google Scholar

Skolem, T. [1920] Logisch-kombinatorische Untersuchungen über die Erfüllbarkeit und Beweisbarkeit mathematischer Sätze nebst einem Theoreme über dichte Mengen, Videnskapsselskapets Skrifter I. Matematisk-naturvidenskapelig Klasse, vol. 4, pp. 1–36, see §4: “Ein Satz über dichte Mengen”.Google Scholar

Tent, K. and Ziegler, M. [2013a] The isometry group of the bounded Urysohn space is simple, Bulletin of the London Mathematical Society, vol. 45, no. 5, pp. 1026–1030. [2013b] On the isometry group of the Urysohn space, Journal of the London Mathematical Society. Second Series, vol. 87, no. 1, pp. 289–303.Google Scholar

Thomas, S. [1991] Reducts of the random graph, The Journal of Symbolic Logic, vol. 56, pp. 176–181. [1998] The nonexistence of a binary homogeneous pseudoplane, Mathematical Logic Quarterly, vol. 44, pp. 135–137.Google Scholar

Wiscons, J. [2016] A reduction theorem for primitive binary permutation groups, Bulletin of the London Mathematical Society, vol. 48, pp. 291–299.CrossRefGoogle Scholar