Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2509.05089

Constructions for positional games and applications to domination games

Ali Deniz Bagdas·Dennis Clemens·Fabian Hamann·Yannick Mogge
View original source ↗Read source document ↗Export metadata ↓

Abstract

We present constructions regarding the general behaviour of biased positional games, and amongst others show that the outcome of such a game can differ in an arbitrary way depending on which player starts the game, and that fair biased games can behave highly non-monotonic. We construct a gadget that helps to transfer such results to Maker-Breaker domination games, and by this we extend a recent result by Gledel, Iršič, and Klavžar, regarding the length of such games. Additionally, we introduce Waiter-Client dominations games, give tight results when they are played on trees or cycles, and using our transference gadget we show that in general the length of such games can differ arbitrarily from the length of their Maker-Breaker analogue.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ali Deniz Bagdas, Dennis Clemens, Fabian Hamann, Yannick Mogge. 2025-09-05. Constructions for positional games and applications to domination games. https://arxiv.org/abs/2509.05089

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Small doublings in abelian groups of prime power torsion

Let $A$ be a subset of $G$, where $G$ is a finite abelian group of torsion $r$. It was conjectured by Ruzsa that if $|A+A|\leq K|A|$, then $A$ is contained in a coset of $G$ of size at most $r^{CK}|A|$ for some constant $C$. The case $r=2$ received considerable attention in a sequence of papers, and was resolved by Green and Tao. Recently, Even-Zohar and Lovett settled the case when $r$ is a prime. In this paper, we confirm the conjecture when $r$ is a power of prime. In particular, the bound we obtain is tight.

math.CO↗
arXiv2026

Graph Polynomial for Colored Embedded Graphs: A Topological Approach

We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in physics. We also analyze a variant of these polynomials for colored embedded graphs. This is used to describe the change in the polynomial under basic graph theoretic operations. We conclude with several applications of this polynomial including detection of certain classes of graphs and the connection of this polynomial with topological entanglement entropy.

math.CO↗
arXiv2026

Schur positivity of the spiders $S(a,2,1)$ and $S(a,4,1)$ via noncommutative symmetric functions

We prove that the spider graphs $S(a,2,1)$ and $S(a,4,1)$ are Schur positive for all integers $a\ge1$. Together with the known $e$-positivity results, this completes the $e$- and Schur-positivity classification of both families. Our approach uses noncommutative symmetric functions, including a particularly simple ribbon expansion for the path lift with coefficients given by powers of two. We give a new proof of the Shareshian--Wachs path formula at $t=1$ and construct corresponding lifts for spiders. The Littlewood--Richardson rule converts their ribbon expansions into a general Schur-coefficient formula in terms of weighted Yamanouchi words. Mass-preserving multi-injections and a reduction to finitely many inequalities in degree $10$ then prove the required positivity; exact computer verification of these inequalities completes the proof in full generality.

math.CO↗