The generalized matcher game

DOI10.1016/J.DAM.2020.04.005zbMATH Open1443.05125arXiv1909.06825OpenAlexW3016715835MaRDI QIDQ777420FDOQ777420

Authors: Anna Bachstein, Wayne Goddard, Connor Lehmacher 

Publication date: 7 July 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: Recently the matcher game was introduced. In this game, two players create a maximal matching by one player repeatedly choosing a vertex and the other player choosing a $K_2$ containing that vertex. One player tries to minimize the result and the other to maximize the result.In this paper we propose a generalization of this game where $K_2$ is replaced by a general graph $F$. We focus here on the case of $F=P_3$. We provide some general results and lower bounds for the game, investigate the graphs where the game ends with all vertices taken, and calculate the value for some specific families of graphs.

Full work available at URL: https://arxiv.org/abs/1909.06825

Recommendations

• The matcher game played in graphs
• A matching game
• Between packable and arbitrarily packable graphs: Packer-spoiler games
• Game matching number of graphs
• scientific article; zbMATH DE number 140096

zbMATH Keywords

lower bounds

Mathematics Subject Classification ID

2-person games (91A05) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Cites Work

• On the Complexity of General Graph Factor Problems
• Mr. Paint and Mrs. Correct
• Domination game and an imagination strategy
• Title not available (Why is that?)
• Game matching number of graphs
• On packing 3-vertex paths in a graph
• The matcher game played in graphs

Cited In (5)

• A matching game
• Parameterized results on acyclic matchings with implications for related problems
• Game matching number of graphs
• Friendly frogs, stable marriage, and the magic of invariance
• The matcher game played in graphs

This page was built for publication: The generalized matcher game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777420)