Blow-up trick in Combinatorics
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911658737139712 |
|---|---|
| author | Phan, Veronica |
| author_facet | Phan, Veronica |
| contents | Blow-up in graph theory is a procedure in which each vertex is replaced by copies of itself, and two copies are adjacent if and only if the original vertices are adjacent. In this paper, we extend the concept of graph blow-up to a more general combinatorial context and discuss its potential applications. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_06725 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Blow-up trick in Combinatorics Phan, Veronica Combinatorics 05C35 (Primary) 05D05 (Secondary) Blow-up in graph theory is a procedure in which each vertex is replaced by copies of itself, and two copies are adjacent if and only if the original vertices are adjacent. In this paper, we extend the concept of graph blow-up to a more general combinatorial context and discuss its potential applications. |
| title | Blow-up trick in Combinatorics |
| topic | Combinatorics 05C35 (Primary) 05D05 (Secondary) |
| url | https://arxiv.org/abs/2605.06725 |