Creating triangles in Constructor-Blocker games

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Boisson, Chloé, Mogge, Yannick, Parreau, Aline, Pierron, Théo
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914079154634752
author Boisson, Chloé
Mogge, Yannick
Parreau, Aline
Pierron, Théo
author_facet Boisson, Chloé
Mogge, Yannick
Parreau, Aline
Pierron, Théo
contents Generalized Turán problems investigate the maximization of the number of certain structures (typically edges) under some constraints in a graph. We study a game version of these problems, the Constructor-Blocker game. We mainly focus on the case where Constructor tries to maximize the number of triangles in her graph, while forbidding her to claim short paths or cycles. We also study a variant of this game, where we impose some planarity constraints on Constructor instead of forbidding certain subgraphs. For all games studied, we obtain (precise) asymptotics or upper and lower bounds.
format Preprint
id arxiv_https___arxiv_org_abs_2510_05811
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Creating triangles in Constructor-Blocker games
Boisson, Chloé
Mogge, Yannick
Parreau, Aline
Pierron, Théo
Combinatorics
05C57, 05C35
Generalized Turán problems investigate the maximization of the number of certain structures (typically edges) under some constraints in a graph. We study a game version of these problems, the Constructor-Blocker game. We mainly focus on the case where Constructor tries to maximize the number of triangles in her graph, while forbidding her to claim short paths or cycles. We also study a variant of this game, where we impose some planarity constraints on Constructor instead of forbidding certain subgraphs. For all games studied, we obtain (precise) asymptotics or upper and lower bounds.
title Creating triangles in Constructor-Blocker games
topic Combinatorics
05C57, 05C35
url https://arxiv.org/abs/2510.05811