3 Questions 4 Answers 0 Followers
Questions related from Marcos Diez García
What are your thoughts on showing that P vs NP is undecidable by proving that solving it is equivalent to solve the halting problem using a form of self-referential argument, like Godel did in his...
09 June 2019 5,803 1 View
In Theorem 5 of [1] it is proved that for any graph G if S a convex subset of vertices of G, then the convex hull of the contour set of S equals the original set S: S = co(Ct(S)). As noted by the...
15 July 2018 4,197 3 View
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...
09 June 2018 4,910 2 View
