Théo Lenoir

activity

20202024

collaborators

4 papers

math.CO2024

Isomorphisms between random $d$ -hypergraphs

Théo Lenoir

We characterize the size of the largest common induced subgraph of two independent random uniform $d$ -hypergraphs of different sizes with $d \geq 3$ . 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…

math.PR2023

Graph classes with few $P_{4}$ 's: Universality and Brownian graphon limits

Théo Lenoir

We consider large uniform labeled random graphs in different classes with few induced $P_{4}$ ( $P_{4}$ is the graph consisting of a single line of $4$ vertices) which generalize the ca…

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…

Isomorphisms between random d-hypergraphs

Subgraph densities and scaling limits of random graphs with a prescribed modular decomposition

Graph classes with few P4​'s: Universality and Brownian graphon limits

At Most 43 Moves, At Least 29: Optimal Strategies and Bounds for Ultimate Tic-Tac-Toe

Isomorphisms between random $d$ -hypergraphs

Graph classes with few $P_{4}$ 's: Universality and Brownian graphon limits