Mathematics > Combinatorics
arXiv:2409.02974 (math)
[Submitted on 4 Sep 2024 (v1), last revised 23 Jun 2026 (this version, v2)]
Abstract: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$.
| Comments: | The results were already known prior to this work. The bounds proved here are superseded by earlier results of Fomin-Kratsch-Todinca-Villanger, Fomin-Villanger and Gaspers-Mackenzie; see the note and references added in this version |
| Subjects: | Combinatorics (math.CO) |
| Cite as: | arXiv:2409.02974 [math.CO] |
| (or arXiv:2409.02974v2 [math.CO] for this version) | |
| https://doi.org/10.48550/arXiv.2409.02974 arXiv-issued DOI via DataCite |
Submission history
From: Domagoj Bradač [view email]
[v1]
Wed, 4 Sep 2024 12:19:53 UTC (4 KB)
[v2]
Tue, 23 Jun 2026 12:30:07 UTC (5 KB)
Current browse context:
math.CO
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Code, Data, Media
Code, Data and Media Associated with this Article
Demos
Demos
Related Papers
Recommenders and Search Tools
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.