Metraipolis › archive › dc_c4437d5fc667

Minimum Weakly Saturated Graphs and Bootstrap Percolation in General Host Graphs — arXiv:2609.01851

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.01851
License (as archived)
CC0-1.0
Archived
2026-10-17T05:32:48.451Z
SHA-256 of the archived text
7a9c8479d7ed17089b1b55340c28d37d215d7f8aab973a4b413c329dffd95510
Stable URL of this page
https://metraipolis.com/documento/dc_c4437d5fc667

How to cite

Minimum Weakly Saturated Graphs and Bootstrap Percolation in General Host Graphs — arXiv:2609.01851 — arXiv (en), https://arxiv.org/abs/2609.01851 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c4437d5fc667 (Metraipolis archive dc_c4437d5fc667, sha256 7a9c8479d7ed17089b1b55340c28d37d215d7f8aab973a4b413c329dffd95510)
BibTeX
@misc{dcc4437d5fc667,
  title = {Minimum Weakly Saturated Graphs and Bootstrap Percolation in General Host Graphs — arXiv:2609.01851},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.01851},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c4437d5fc667; sha256 7a9c8479d7ed17089b1b55340c28d37d215d7f8aab973a4b413c329dffd95510},
  year = {2026}
}

Archived text

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

A graph $G$ is weakly $H$-saturated if one can obtain $K_n$ by adding one edge to $G$ at a time, where each additional edge creates at least one new copy of $H$. The minimum number of edges needed for a weakly $H$-saturated graph $G$ of order $n$ is known as the weak saturation number of $H$, written $wsat(n,H)$. A graph $G$ is minimum weakly saturated if $wsat(n,G)=|E(G)|-1$ for some value of $n$. We explore classes of minimum weakly saturated graphs and their connection to the $H$-bootstrap percolation process, as well as weak saturation in a more general setting than the complete graph.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-03 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.01851 — 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-17T04:59:51.757Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-03?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).