Metraipolis › archive › dc_caba7a75379d

A One-Third Bound for the Maker--Breaker Degree Game — arXiv:2608.20644

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.20644
License (as archived)
CC0-1.0
Archived
2026-10-18T10:46:55.799Z
SHA-256 of the archived text
eae5306b6b588f2e5c2cb125780b71c7ef19c0204f154813425463cbd972f0b3
Stable URL of this page
https://metraipolis.com/documento/dc_caba7a75379d

How to cite

A One-Third Bound for the Maker--Breaker Degree Game — arXiv:2608.20644 — arXiv (en), https://arxiv.org/abs/2608.20644 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_caba7a75379d (Metraipolis archive dc_caba7a75379d, sha256 eae5306b6b588f2e5c2cb125780b71c7ef19c0204f154813425463cbd972f0b3)
BibTeX
@misc{dccaba7a75379d,
  title = {A One-Third Bound for the Maker--Breaker Degree Game — arXiv:2608.20644},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.20644},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_caba7a75379d; sha256 eae5306b6b588f2e5c2cb125780b71c7ef19c0204f154813425463cbd972f0b3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.20644. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Let \(H\) be a finite hypergraph with rank $r$ and minimum degree \(d\). In the Maker--Breaker degree game, Maker and Breaker alternately claim previously unclaimed hyperedges of \(H\), with Maker moving first, and Breaker seeks to maximize the minimum degree $\delta(H_{\mathrm B})$ of his spanning subhypergraph $H_{\mathrm B}$. We prove that, for every fixed \(r\ge2\) and all sufficiently large \(d\), Breaker has a deterministic strategy satisfying \[ \delta(H_{\mathrm B})\ge \frac{d}{r+1}-\sqrt{d\log d}. \] For graphs, this improves the classical universal lower bound \(d/4\) to \(d/3-\sqrt{d\log d}\). The proof introduces a virtual balancing process, encodes local imbalance by a multiplicative risk, and keeps the resulting risk vector in the Shearer region throughout the game.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-24 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.20644 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T10:39:26.738Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).