On the lengths of symmetry breaking-preserving games on graphs

From MaRDI portal
(Redirected from Publication:1885002)



Abstract: Given a graph G, we consider a game where two players, A and B, alternatingly color edges of G in red and in blue respectively. Let l(G) be the maximum number of moves in which B is able to keep the red and the blue subgraphs isomorphic, if A plays optimally to destroy the isomorphism. This value is a lower bound for the duration of any avoidance game on G under the assumption that B plays optimally. We prove that if G is a path or a cycle of odd length n, then Omega(logn)lel(G)leO(log2n). The lower bound is based on relations with Ehrenfeucht games from model theory. We also consider complete graphs and prove that l(Kn)=O(1).












This page was built for publication: On the lengths of symmetry breaking-preserving games on graphs

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