Ander Lamaison's homepage
Faculty of Informatics, office C516
602 00 Brno, Czech Republic
lamaison (at) mail.muni.cz
I'm currently a postdoctoral researcher at the Faculty of Informatics in Masaryk University in Brno, Czech Republic. I am working in Dan Král's group at the Laboratory of Discrete Methods and Algorithms (DIMEA). Previously, I was a PhD student at Freie Universität Berlin, under the supervision of Tibor Szabó.
My research area is discrete mathematics, specifically extremal combinatorics, with a special focus on Ramsey theory.
F. Garbe, D. Král' and A. Lamaison: Hypergraphs with minimum positive Turán density. arXiv:2105.09883
J. Cooper, D. Král', A. Lamaison and S. Mohr: Quasirandom Latin squares. arXiv:2011.07572
A. Lamaison, A. Müyesser and M. Tait: On a colored Turán problem of Diwan and Mubayi. arXiv:2010.02953
P. Candela, C. Catalá, R. Hancock, A. Kabela, D. Král', A. Lamaison and L. Vena: Coloring graphs by translates in the circle. European Journal of Combinatorics 96 (2021). arXiv:2004.01145
A. Lamaison: Ramsey upper density of infinite graphs. arXiv:2003.06329. Extended abstract on Acta Mathematica Univeritatis Comenianae 88 (2019), issue 3.
M. Anastos, A. Lamaison, R. Steiner and T. Szabó. Majority Colorings of Sparse Digraphs. The Electronic Journal of Combinatorics 28 (2021), issue 2, #P2.31. arXiv:1911.01954
A. Lamaison: The random strategy in Maker-Breaker graph minor games. arXiv:1907.04804
J. Corsten, L. DeBiasio, A. Lamaison and R. Lang: Upper density of monochromatic infinite paths. Advances in Combinatorics, 2019:4. arXiv:1808.03006
M. Bowen, A. Lamaison and A. Müyesser: Finding unavoidable colorful patterns in multicolored graphs. The Electronic Journal of Combinatorics 27 (2020), issue 4, #P4.4. arXiv:1807.02780
G. Kronenberg, C. Kusch, A. Lamaison, P. Micek and T. Tran: A Note on the Minimum Number of Edges in Hypergraphs with Property O. European Journal of Combinatorics 81 (2019), 172-177. arXiv:1703.09767
Hypergraphs with minimum positive Turán density. EUROCOMB, 2021.
Hypergraphs with minimum positive Turán density. CanaDAM, 2021.
Ramsey upper density of infinite graphs. SCMS Combinatorics Seminar, 2021.
Ramsey upper density of infinite graphs. ITI Online Seminar, 2020.
Ramsey upper density of infinite graphs. Warwick Combinatorics Seminar, 2020. Warwick, United Kingdom.
Ramsey upper density of infinite graphs. Princeton Discrete Math Seminar, 2020. Princeton, United States.
My favorite open problems. Combinatorics Literature Seminar at UIUC, 2020. Urbana-Champaign, United States.
Ramsey upper density of infinite graphs. EUROCOMB, 2019. Bratislava, Slovakia.
Ramsey upper density of infinite graphs. British Combinatorial Conference, 2019. Birmingham, United Kingdom.
The random strategy in Maker-Breaker graph minor games. 19th International Conference on Random Structures and Algorithms, 2019. Zurich, Switzerland.
The random strategy in Maker-Breaker graph minor games. Mini-workshop on positional games, 2018. Oberwolfach, Germany.
Ramsey density of infinite paths. Berlin-Poznan-Hamburg Seminar on Discrete Mathematics, 2018. Berlin, Germany.
Ramsey density of infinite paths. Berlin-Tel Aviv joint workshop on Graph and Hypergraph Colouring, 2018. Berlin, Germany.
The densest monochromatic infinite path. Graphs @ IMPA, 2018. Rio de Janeiro, Brazil.