Ref.: Duchet. Convexity in Combinatorial Structures, 1985.
I am using the characterisation given in [Ref, p. 269] for the Caratheodory number: the Caratheodory number equals the least integer k such that every k+1-point set A satisfies: = U , for a in A. Where < > is the convex hull, U union of sets and \ set difference.
I have been trying various examples for the hypercube and so far all of them fulfil the property above for k = 2. For instance, consider the 4-dim hypercube. Let A = {0000, 1000, 1010}. Then we have:
1. = {0000, 1000, 1010, 0010}
2. = {1000, 1010}
3. = {0000, 1010, 1000, 0010}
4. = {0000, 1000}
Therefore, = U U . I haven't yet found an example of A where this does not happen.
I would appreciate if someone could provide a counterexample. Also I would appreciate reference to papers where they provide a Theorem/Corollary/Lemma for the Caratheodory num of the hypercube if any.
Thank you.