arXiv Open Access 2024

On a question of Erdős and Nešetřil about minimal cuts in a graph

Domagoj Bradač

Lihat Sumber

Abstrak

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$.

Topik & Kata Kunci

math.CO

Penulis (1)

Domagoj Bradač

Format Sitasi

APA MLA BibTeX

Bradač, D. (2024). On a question of Erdős and Nešetřil about minimal cuts in a graph. https://arxiv.org/abs/2409.02974

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2024
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓