3 papers
math.CO2024
Isomorphisms between random -hypergraphs
Théo Lenoir
We characterize the size of the largest common induced subgraph of two independent random uniform -hypergraphs of different sizes with . More precisely, its distributio…
math.CO2023
Subgraph densities and scaling limits of random graphs with a prescribed modular decomposition
Théo Lenoir
We consider large uniform labeled random graphs in different classes with prescribed decorations in their modular decomposition. Our main result is the estimation of the number of…
cs.GT2020
At Most 43 Moves, At Least 29: Optimal Strategies and Bounds for Ultimate Tic-Tac-Toe
Guillaume Bertholon, Rémi Géraud-Stewart, Axel Kugelmann +2
Ultimate Tic-Tac-Toe is a variant of the well known tic-tac-toe (noughts and crosses) board game. Two players compete to win three aligned "fields", each of them being a tic-tac-to…