Game matching number of graphs

  title={Game matching number of graphs},
  author={Daniel W. Cranston and Bill Kinnersley and O Suil and Douglas B. West},
  journal={Discret. Appl. Math.},
We study a competitive optimization version of @a^'(G), the maximum size of a matching in a graph G. Players alternate adding edges of G to a matching until it becomes a maximal matching. One player (Max) wants the final matching to be large; the other (Min) wants it to be small. The resulting sizes under optimal play when Max or Min starts are denoted @a"g^'(G) and @a@?"g^'(G), respectively. We show that always |@a"g^'(G)-@a@?"g^'(G)|@?1. We obtain a sufficient condition for @a"g^'(G)=@a^'(G… 
The matcher game played in graphs
It is proved that α g ′ ( G ) ≥ 2 3 α ‹ ( G) , where α ′ ‹ denotes the matching number of graph G, and this bound is tight, if G is bipartite.
Games on graphs, visibility representations, and graph colorings
In this thesis we study combinatorial games on graphs and some graph parameters whose consideration was inspired by an interest in the symmetry of hypercubes. A capacity function f on a graph G
On saturation games
It is demonstrated that thescore of certain games can be as large as the Turan number or as low as the saturation number of the respective graph property, and also that the score might strongly depend on the identity of the first player to move.
Domination Game: A proof of the 3/5-Conjecture for Graphs with Minimum Degree at Least Two
It is proved that if $G$ is an $n$-vertex isolate-free graph with $\ell$ vertices of degree 1, then $\gamma_g(G) \le 3n/5 + \left \lceil \ell/2 \right \rceil + 1$; in the course of establishing this result, a question of Bresar e...
Paired-Domination Game Played in Graphs
In this paper, we continue the study of the domination game in graphs introduced by Bre{v{s}}ar, Klav{v{z}}ar, and Rall. We study the paired-domination version of the domination game which adds a
Saturation Games for Odd Cycles
  • Sam Spiro
  • Computer Science, Mathematics
    Electron. J. Comb.
  • 2019
It is shown that the number of edges that are in the final graph when both players play optimally is the same, andsat_g(\mathcal{C}_\infty\setminus C_3;n) is proved to be 2n-2, where $k\ge 2$ denotes the set of all odd cycles.
The generalized matcher game
Some general results and lower bounds for the matcher game are provided, the graphs where the game ends with all vertices taken are investigated, and the value is calculated for some specific families of graphs.
Bounds on the game transversal number in hypergraphs
The game transversal number, g(H), of H is the number of vertices chosen when Edge-hitter starts the game and both players play optimally, and an important fact concerning the monotonicity of g is presented, that is called the Transversal Continuation Principle.
An upper bound on the extremal version of Hajnal's triangle-free game
With optimal play, the length of the game (number of edges played) is called the K 3 game saturation number, and this paper proves an upper bound for this number.
The Game Saturation Number of a Graph
The lower bound on the length under optimal play of the P_4-saturation game on K_{m,n} is proved, which is similar to the results when Min plays first.


Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph
Tight lower bounds on the size of a maximum matching in a regular graph of order n and α′(G) are studied, which show that if k is even, then α' (G) \ge \min \left(k^3-k^2-2) \, n - 2k + 2}{2(k-3-3k)} .
A Problem in Graph Theory
A gruph consists of a finite set of vertices some pairs of which are adjacent, i.e., joined by an edge. No edge joins a vertex to itself and at most one edge joins any two vertices. The degree of a
Connected, Bounded Degree, Triangle Avoidance Games
This work considers variants of the triangle-avoidance game first defined by Harary and rediscovered by Hajnal a few years later, and determines the winner for all values of $n.
Bounded Degree, Triangle Avoidance Graph Games
This work considers variants of the triangle-avoidance game first defined by Harary and rediscovered by Hajnal and determines the winner for all values of n.
Winning Fast in Sparse Graph Construction Games
If G is a d-degenerate graph on n vertices and N > d1122d+9n, then Maker can claim a copy of G in at most d1121d+7n rounds, and a lower bound on the number of rounds Maker needs to win is discussed.
Planarity, Colorability, and Minor Games
The Maker-Breaker and Avoider-Enforcer versions of the planarity game, the $k$-colorability game, and the $K_t$-minor game are considered.
Fast Winning Strategies in Avoider-Enforcer Games
For several games that are known to be an Enforcer’s win, the minimum number of moves Enforcer has to play in order to win is estimated quite precisely.
On n-extendable graphs
  • M. Plummer
  • Computer Science, Mathematics
    Discret. Math.
  • 1980
Nearly all n-extendable graphs (n>=2) are shown to be (n-1)-extendedable and (n + 1)- connected.
On Hajnal's triangle-free game
  • Á. Seress
  • Mathematics, Computer Science
    Graphs Comb.
  • 1992
This work investigates the triangle-free game proposed by András Hajnal and determines the winner in a version of the game with the additional rule that the chosen edges must always give a connected subgraph ofKn.
Subtrees and Subforests of Graphs
  • S. Brandt
  • Computer Science, Mathematics
    J. Comb. Theory, Ser. B
  • 1994
The edge-number bound answers in the affirmative a conjecture due to Erdős and Sos and improved bounds for specified spanning subtrees of graphs are given.