--- title: 'MT-breaker: Disambiguation & Applications' url: https://www.emergentmind.com/topics/mt-breaker type: topic --- # MT-breaker: Disambiguation & Applications MT-breaker is a nonstandard, context-dependent label rather than a stable technical term. In current arXiv usage, it denotes markedly different objects across distinct research literatures: a family of Maker–Breaker graph games, especially domination and total-domination variants; breaker-centered hidden topology attacks on power grids; and, in nanoelectronic reliability, the breakdown of a magnetic tunnel junction (MTJ) tunnel barrier under time-dependent dielectric breakdown (TDDB). Its meaning is therefore determined by the surrounding formalism rather than by a field-independent definition [1807.09479] [1506.04303] [1609.05919]. ## 1. Terminological status and principal senses The term is best understood as a disambiguation problem. In combinatorial game theory, “breaker” is the adversarial player in a Maker–Breaker positional game. In power-systems security, “breaker” refers literally to transmission-line breaker statuses manipulated in a hidden topology attack. In MTJ reliability modeling, the expression refers to an MTJ whose dielectric barrier has “broken” electrically under TDDB, and one paper explicitly states that it is not a separate device class or a standard acronym [1609.05919]. | Context | Meaning | Representative source | |---|---|---| | Combinatorial game theory | Maker–Breaker game framework; in one paper the relevant object is the Maker–Breaker domination game | [1807.09479] | | Power-systems security | Breaker-jammer hidden topology attack using breaker-status changes and flow-measurement jamming | [1506.04303] | | Spintronics / reliability | MTJ barrier breakdown under TDDB; not a separate device class or standard acronym | [1609.05919] | A plausible implication is that lexical similarity alone is not sufficient for retrieval or citation. Nearby terms can be unrelated: for example, “MultiBreak” denotes a multi-turn jailbreak benchmark for LLM safety rather than a breaker-centered graph game or device-failure model [2605.01687]. ## 2. MT-breaker in Maker–Breaker domination and total-domination games In graph-theoretic usage, the most direct interpretation is the Maker–Breaker domination game. The game is played on a graph \(G=(V,E)\), with a position modeled as \(G=(V,E,c)\), where \(c:V\to \{\text{Dominator},\text{Staller},\text{Unplayed}\}\). Dominator and Staller alternately choose unplayed vertices. Dominator wins when the set of vertices he has chosen becomes a dominating set; Staller wins when she occupies the closed neighborhood \(N[u]\) of some vertex \(u\), thereby isolating that vertex from Dominator [1807.09479]. The outcome classes are \(D\), \(S\), \(N\), and \(P\), but the paper proves that \(P\) never occurs: if a player can win as second player, that player can also win as first player by an imagination strategy [1807.09479]. The same paper establishes that deciding the outcome is PSPACE-complete on bipartite graphs and on split graphs, while admitting polynomial-time algorithms on cographs and trees; its central structural certificate is the pairing dominating set, a family of pairs \(\{(u_1,v_1),\dots,(u_k,v_k)\}\) such that \[ V=\bigcup_{i=1}^k N[u_i]\cap N[v_i]. \] If such a set exists, then Dominator has a winning strategy [1807.09479]. The Maker–Breaker total domination game is the total-domination analogue of this framework. Dominator now wins only when his chosen vertices form a total dominating set, so every vertex must have a neighbor in Dominator’s set; Staller wins by selecting all vertices in the open neighborhood \(N(u)\) of some vertex \(u\) [1902.00204]. This variant is strictly harder for Dominator. The paper proves that no minimum-degree condition is sufficient to guarantee that Dominator wins when Staller starts, and that there are infinitely many connected cubic graphs in which Staller wins [1902.00204]. It also classifies several graph classes: for grids, \[ P_m \square P_n \] is \(D\) if both \(m\) and \(n\) are even and \(S\) otherwise; for cacti, the outcome is determined by whether the graph decomposes into induced \(C_4\)-blocks or reduces to an \(N\)-star cactus under iterative deletion of end-blocks \(C_4\) [1902.00204]. The same paper places the game in a hypergraph setting by taking hyperedges to be open neighborhoods \(\{N(v):v\in V(G)\}\), so that the MBTD game becomes a Maker–Breaker game on a neighborhood hypergraph [1902.00204]. A later extension introduces quantitative game-length invariants. The Maker–Breaker total domination number \(\gamma_{\rm MBT}(G)\) is the minimum number of Dominator moves needed to win when Dominator starts, and \(\gamma_{\rm MBT}'(G)\) is defined analogously when Staller starts. The paper proves the sharp bounds \[ \gamma_{\rm MBT}(G)\le \left\lceil \frac{n(G)}{2}\right\rceil,\qquad \gamma_{\rm MBT}'(G)\le \left\lfloor \frac{n(G)}{2}\right\rfloor, \] together with \[ \gamma_t(G)\le \gamma_{\rm MBT}(G)\le \gamma_{\rm MBT}'(G), \] and strong realizability results: for any \(2\le k\le \ell\), there exist connected graphs realizing \((\gamma_{\rm MB},\gamma_{\rm MBT})=(k,\ell)\), \((\gamma_{\rm MB}',\gamma_{\rm MBT}')=(k,\ell)\), and \((\gamma_{\rm MBT},\gamma_{\rm MBT}')=(k,\ell)\) [2507.17341]. This shows that, within the Maker–Breaker interpretation, “MT-breaker” may refer either to an outcome problem or to a quantitative invariant of optimal play. ## 3. Threshold phenomena in Maker–Breaker graph games A broader combinatorial interpretation places Breaker in probabilistic and extremal graph games. In the Maker–Breaker \(H\)-game on the random graph \(G_{n,p}\), Maker and Breaker alternately claim unclaimed edges of \(G_{n,p}\), and Maker wins if his claimed edges contain all edges of some copy of a fixed graph \(H\). The threshold function \(p_0(n,H)\) is defined by \[ \lim_{n\to\infty}\Pr\big[G_{n,p}\text{ is Maker's win in the }H\text{-game}\big] = \begin{cases} 1,& p\gg p_0(n,H),\\ 0,& p\ll p_0(n,H). \end{cases} \] The key density parameter is \[ d_2(G):=\frac{|E(G)|-1}{|V(G)|-2},\qquad m_2(G):=\max_{J\subseteq G,\ v_J\ge 3} d_2(J). \] If \(H\) contains a subgraph \(H'\subseteq H\) such that \(d_2(H')=m_2(H)\), \(H'\) is strictly 2-balanced, and \(H'\) is not a tree or a triangle, then there exist constants \(c,C>0\) such that the threshold is of order \(n^{-1/m_2(H)}\): \[ \Pr\big[G_{n,p}\text{ is Maker's win in the }H\text{-game}\big]\to \begin{cases} 1,& p\ge C n^{-1/m_2(H)},\\ 0,& p\le c n^{-1/m_2(H)}. \end{cases} \] This matches the corresponding random Ramsey threshold. Triangles are exceptional: for \(H=K_3\), although \(m_2(K_3)=2\), the Maker–Breaker triangle game has threshold \(n^{-5/9}\), not \(n^{-1/2}\) [1401.4384]. Random-player Maker–Breaker games shift the asymmetry from the board to the players. In the \((1:b)\) random-Breaker game on \(E(K_n)\), Breaker chooses \(b\) unclaimed edges uniformly at random while Maker plays strategically. For the Hamilton cycle game, the perfect-matching game, and the \(k\)-vertex-connectivity game, the critical bias satisfies \[ b^*=(1+o(1))n, \] and the paper gives explicit winning strategies for Maker in the corresponding range \(b\le (1-\varepsilon)n\) [1502.00445]. In the dual \((m:1)\) random-Maker model, Maker is random and Breaker is strategic. Here the critical scale is logarithmic: \[ m^*=\Theta(\ln\ln n). \] Breaker can isolate a vertex when \(m\le (1-\varepsilon)\ln\ln n\), while Maker can typically force Hamiltonicity and \(k\)-connectivity once \(m>A\ln\ln n\) for a suitable constant \(A>0\) [1502.00445]. The contrast shows that “Breaker” may encode either a sparsification mechanism or a local isolation strategy, depending on which side plays randomly. On complete graphs with no randomization, exact small-board thresholds are also known. In the unbiased Hamiltonicity game on \(E(K_n)\), Maker wins if and only if \(n\ge 8\), independent of who starts. For the Hamiltonian Path game, Maker wins if and only if \(n\ge 5\). For the Fixed Hamiltonian Path game, Maker wins if and only if \(n\ge 7\) when Maker starts and if and only if \(n\ge 8\) when Breaker starts [1708.07579]. These results were obtained by a computer-assisted minimax search with canonical labeling and isomorphism pruning, and they also yielded the extremal bound \[ \hat m(n)\le 4n\qquad\text{for }n\ge 336 \] for the minimum number of edges in an \(n\)-vertex graph on which Maker can still win Hamiltonicity [1708.07579]. ## 4. Breaker as separator on random trees, lattices, and random boards A distinct but related line of work studies Breaker as a separator rather than as an occupation-based blocker. On a Galton–Watson tree \(T\) with root \(\mathbf 0\), Breaker deletes one available edge per round, thereby removing the child endpoint and all descendants, while Maker fixates one available edge and secures it permanently. Breaker wins when the root lies in a finite component; Maker wins by sustaining an infinite path from the root [2412.08334]. If \(\xi\) is the offspring distribution with probability generating function \(g(x)=E(x^\xi)\), then the winning probability of Breaker depends sharply on the information regime. With full information, the probabilities \(p\) and \(\bar p\) that Breaker wins when Breaker or Maker starts satisfy \[ p=g(p)+(1-p)g'(p),\qquad \bar p=g(p). \] With no extra information and no leaves, the game reduces to a left-continuous random walk, and \(p\) satisfies \[ p^2=g(p), \] while in the subtree-size-information regime the fixed-point equation becomes \[ x^2(1-q)=g(x(1-q)+q)-q, \] where \(q\) is the extinction probability of the original Galton–Watson process [2412.08334]. The paper emphasizes that more information tends to favor Breaker and that the phase transition may be discontinuous in the full-information regime. On planar lattices, Breaker often appears as a dual obstruction. In the \((p,q)\)-Maker–Breaker crossing game on the triangular grid graph \(\Delta_{m,n}\), Maker tries to claim a left-to-right path, while Breaker tries to prevent it. The paper proves that Maker has a winning strategy for sufficiently tall grids when \(p\ge q\), specifically when \(n\ge q+2\), and that Breaker has a winning strategy for sufficiently wide grids when \(q\ge 4p\), specifically when \(m\ge q+1\) [2201.01348]. The proof uses “secure” components, blue paths, and brackets in the primal and dual lattices; the non-self-duality of the triangular grid forces the Breaker threshold to be expressed through the dual hexagonal geometry rather than by a symmetry argument [2201.01348]. On random boards, the Maker–Breaker percolation game on \((\mathbb Z^2)_p\) sharpens the separator viewpoint. Each edge of \(\mathbb Z^2\) is kept independently with probability \(p\), Maker chooses a protected vertex \(v_0\), and then Maker and Breaker alternately claim \(m\) and \(b\) unclaimed edges. Breaker wins if the component of \(v_0\) becomes finite [2402.17547]. For the \((1,1)\) game, Breaker almost surely has a winning strategy for every \(00.94013 \Rightarrow \text{Maker wins a.s.} \] [2402.17547]. The paper further introduces the threshold \[ P_{(m,b)}(A)=\sup\{0