Graph factors and powers of Hamilton cycles in the budget-constrained random graph process
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917940318699520 |
|---|---|
| author | Díaz, Alberto Espuny Garbe, Frederik Naia, Tássio Smith, Zak |
| author_facet | Díaz, Alberto Espuny Garbe, Frederik Naia, Tássio Smith, Zak |
| contents | We consider the following budget-constrained random graph process introduced by Frieze, Krivelevich and Michaeli. A player, called Builder, is presented with $t$ distinct edges of $K_n$ one by one, chosen uniformly at random. Builder may purchase at most $b$ of these edges, and must (irrevocably) decide whether to purchase each edge as soon as it is offered. Builder's goal is to construct a graph which satisfies a certain property; we investigate the properties of containing different $F$-factors or powers of Hamilton cycles.
We obtain general lower bounds on the budget $b$, as a function of $t$, required for Builder to obtain partial $F$-factors, for arbitrary $F$. These imply lower bounds for many distinct spanning structures, such as powers of Hamilton cycles. Notably, our results show that, if $t$ is close to the hitting time for a partial $F$-factor, then the budget $b$ cannot be substantially lower than $t$. These results give negative answers to questions of Frieze, Krivelevich and Michaeli.
Conversely, we also exhibit a simple strategy for constructing (partial) $F$-factors, in particular showing that our general lower bound is tight up to constant factors. The ideas from this strategy can be exploited for other properties. As an example, we obtain an essentially optimal strategy for powers of Hamilton cycles. In order to formally prove that this strategy succeeds, we develop novel tools for analysing multi-stage strategies, which may be of general interest for studying other properties. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_20870 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Graph factors and powers of Hamilton cycles in the budget-constrained random graph process Díaz, Alberto Espuny Garbe, Frederik Naia, Tássio Smith, Zak Combinatorics We consider the following budget-constrained random graph process introduced by Frieze, Krivelevich and Michaeli. A player, called Builder, is presented with $t$ distinct edges of $K_n$ one by one, chosen uniformly at random. Builder may purchase at most $b$ of these edges, and must (irrevocably) decide whether to purchase each edge as soon as it is offered. Builder's goal is to construct a graph which satisfies a certain property; we investigate the properties of containing different $F$-factors or powers of Hamilton cycles. We obtain general lower bounds on the budget $b$, as a function of $t$, required for Builder to obtain partial $F$-factors, for arbitrary $F$. These imply lower bounds for many distinct spanning structures, such as powers of Hamilton cycles. Notably, our results show that, if $t$ is close to the hitting time for a partial $F$-factor, then the budget $b$ cannot be substantially lower than $t$. These results give negative answers to questions of Frieze, Krivelevich and Michaeli. Conversely, we also exhibit a simple strategy for constructing (partial) $F$-factors, in particular showing that our general lower bound is tight up to constant factors. The ideas from this strategy can be exploited for other properties. As an example, we obtain an essentially optimal strategy for powers of Hamilton cycles. In order to formally prove that this strategy succeeds, we develop novel tools for analysing multi-stage strategies, which may be of general interest for studying other properties. |
| title | Graph factors and powers of Hamilton cycles in the budget-constrained random graph process |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2502.20870 |