On the lengths of symmetry breaking-preserving games on graphs
From MaRDI portal
(Redirected from Publication:1885002)
Abstract: Given a graph , we consider a game where two players, and , alternatingly color edges of in red and in blue respectively. Let be the maximum number of moves in which is able to keep the red and the blue subgraphs isomorphic, if plays optimally to destroy the isomorphism. This value is a lower bound for the duration of any avoidance game on under the assumption that plays optimally. We prove that if is a path or a cycle of odd length , then . The lower bound is based on relations with Ehrenfeucht games from model theory. We also consider complete graphs and prove that .
Recommendations
Cites work
- scientific article; zbMATH DE number 3885959 (Why is no real title available?)
- scientific article; zbMATH DE number 3900800 (Why is no real title available?)
- scientific article; zbMATH DE number 1324669 (Why is no real title available?)
- scientific article; zbMATH DE number 1944410 (Why is no real title available?)
- Parallel concepts in graph theory
- The strange logic of random graphs
Cited in
(2)
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)