Carath\'eodory Number in Cycle Convexity

TL;DR

This paper studies the Carathéodory number in cycle convexity, proving NP-completeness for general graphs and providing polynomial algorithms for specific classes, along with characterizations of extremal cases.

Contribution

It establishes NP-completeness of computing the Carathéodory number and offers exact values, bounds, and characterizations for various graph classes and graph products.

Findings

NP-complete to decide if ar(G) t least k for bipartite graphs

Polynomial-time algorithms for forests, cycles, complete, and other special graphs

Characterizations of graphs with ar(G) near n, including ar(G) = n-1 and n-2

Abstract

Let $G$ be a graph and $S \subseteq V(G)$. In the cycle convexity, we say that $S$ is \textit{cycle convex} if for any $u\in V(G)\setminus S$, the induced subgraph of $S\cup\{u\}$ contains no cycle that includes $u$. The \textit{cycle convex hull} of $S$, denoted by $\hullc (S)$, is the smallest cycle convex set containing $S$. A set $S \subseteq V(G)$ is said to be \textit{Carath\'eodory independent} if there exists a vertex $u \in \hullc(S) $ such that $u \notin\displaystyle \bigcup_{a \in S} \hullc (S \setminus \{a\}) $, and the Carath\'eodory number $\car(G)$ is the maximum size of such a set. In this paper, we prove that given a graph $G$ and $k \in \mathbb{N}$, deciding whether $\car(G) \geq k$ is \NP-complete, even when $G$ is bipartite. On the other hand, we derive exact values and constant upper bounds for several graph classes, leading to polynomial-time algorithms. Some of them include forests, cycles, complete graphs, complete multipartite, split, and $P_4$-sparse graphs. In addition, we present a characterization of $n$-vertex graphs $G$ with extremal values near to $n$, including $\car(G) = n-1$ and $\car(G) = n-2$. Furthermore, we investigate the behavior of the Carath\'eodory number under graph products such as the strong, lexicographic, and Cartesian products.