Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2510.06392 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866918156290752512 |
|---|---|
| author | Ge, Wayne |
| author_facet | Ge, Wayne |
| contents | In this paper, we introduce super-minimally $k$-connected graphs, those $k$-connected graphs in which no proper subgraph is $k$-connected. For $k$ greater than or equal to three, this class lies strictly between the classes of minimally $k$-connected graphs and uniformly $k$-connected graphs. In particular, we determine the minimum number of degree-$3$ vertices in a super-minimally $3$-connected graph, thereby extending a result of Halin on minimally $3$-connected graphs. In addition, we determine the maximum number of edges in a super-minimally $3$-connected graph, extending Xu's result for uniformly $3$-connected graphs, and providing an analogue of Halin's result for minimally $3$-connected graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_06392 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Super-minimally $3$-connected graphs Ge, Wayne Combinatorics In this paper, we introduce super-minimally $k$-connected graphs, those $k$-connected graphs in which no proper subgraph is $k$-connected. For $k$ greater than or equal to three, this class lies strictly between the classes of minimally $k$-connected graphs and uniformly $k$-connected graphs. In particular, we determine the minimum number of degree-$3$ vertices in a super-minimally $3$-connected graph, thereby extending a result of Halin on minimally $3$-connected graphs. In addition, we determine the maximum number of edges in a super-minimally $3$-connected graph, extending Xu's result for uniformly $3$-connected graphs, and providing an analogue of Halin's result for minimally $3$-connected graphs. |
| title | Super-minimally $3$-connected graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2510.06392 |