Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2409.02974 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909305856327680 |
|---|---|
| author | Bradač, Domagoj |
| author_facet | Bradač, Domagoj |
| contents | Answering a question of Erdős and Nešetřil, we show that the maximum number of inclusion-wise minimal vertex cuts in a graph on $n$ vertices is at most $1.8899^n$ for large enough $n$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_02974 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On a question of Erdős and Nešetřil about minimal cuts in a graph Bradač, Domagoj Combinatorics Answering a question of Erdős and Nešetřil, we show that the maximum number of inclusion-wise minimal vertex cuts in a graph on $n$ vertices is at most $1.8899^n$ for large enough $n$. |
| title | On a question of Erdős and Nešetřil about minimal cuts in a graph |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2409.02974 |