Skip to content

Author

Arsen Berk Tekdaş

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

The Exact Degree Threshold for Complement Connectivity

For a graph $G$, we investigate sufficient degree conditions under which either $G$ or its complement $\overline{G}$ is $k$-connected. Motivated by a theorem of Hellwig and Volkmann, we introduce the notion of complement connectivity admissible pairs and define the parameter $\mathcal{C}(k)$ as the minimum degree thres...

Arsen Berk Tekdaş · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.