# Ander Lamaison's homepage

Faculty of Informatics, office C516

Botanická 68A

602 00 Brno, Czech Republic

lamaison (at) mail.muni.cz

## About me

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.

## Papers

D. Král', A. Lamaison and P. P. Pach: Common systems of two binary equations. To appear. Extended abstract on proceedings for Discrete Mathematics Days 2022.

M. Borbényi, P. Fekete, A. Hrušková and A. Lamaison: Logarithmic convergence of projective planes. To appear. Extended abstract on proceedings for Discrete Mathematics Days 2022.

D. Král' and A. Lamaison: Planar graph with twin-width seven. arXiv:2209.11537

F. Garbe, D. Král' and A. Lamaison: Hypergraphs with minimum positive Turán density. Accepted to Israel Journal of Mathematics. arXiv:2105.09883

J. Cooper, D. Král', A. Lamaison and S. Mohr: Quasirandom Latin squares. Random Structures and Algorithms 61 (2022), Issue 2, 298-308. arXiv:2011.07572.

J. Balogh and A. Lamaison: Ramsey upper density of infinite graph factors. Illinois Journal of Mathematics 67 (2023), Issue 1, 171-184. arXiv:2010.13633

A. Lamaison, A. Müyesser and M. Tait: On a colored Turán problem of Diwan and Mubayi. Discrete Mathematics 345 (2022), Issue 10 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. Accepted to Combinatorics, Probability and Computing.

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

## Talks

Logarithmic convergence of projective planes. 20th International Conference on Random Structures and Algorithms, 2022. Gniezno, Poland.

Logarithmic convergence of projective planes. Discrete Mathematics Days, 2022. Santander, Spain.

Common systems of two equations over the binary field. Discrete Mathematics Days, 2022. Santander, Spain.

Quasirandomness. Workshop: Interfaces of the Theory of Combinatorial Limits, 2022. Budapest, Hungary.

Ramsey upper density of infinite graphs. Rényi Institute Combinatorics Seminar, 2021. Budapest, Hungary.

Hypergraphs with minimum positive Turán density. Young Researchers in Extremal and Probabilistic Combinatorics, 2021. Online.

Hypergraphs with minimum positive Turán density. EUROCOMB, 2021. Online.

Hypergraphs with minimum positive Turán density. CanaDAM, 2021. Online.

Ramsey upper density of infinite graphs. SCMS Combinatorics Seminar, 2021. Online.

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.

Ramsey upper density of infinite graphs. Rutgers Discrete Math Seminar, 2020. New Brunswick, 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.