4 problems

0 votes0 replies1 view
Gaetz–Gao's strong hull conjecture for Coxeter groups
Gaetz–Gao's strong hull conjecture. Every Coxeter group $W$ has the property that its Cayley graph $\mathrm{Cay}(W)$ satisfies the strong hull property.
Conjectureopencayley-graphs coxeter-groups graph-convexityarXiv posted 2 days ago
0 votes0 replies0 views
Equality of the Helly and Radon numbers for connected graphs under $\Delta$ -convexity
Helly–Radon equality conjecture.
Conjectureopengraph-convexity helly-theorems radon-numbersarXiv posted 2 days ago
0 votes0 replies0 views
The cycle-convexity hull-number upper bound for tunnel numbers of links
Let $K$ be a link with a diagram $D(K)$ , and let $G_{D(K)}$ be its associated graph. Denote by $\operatorname{hn_{cc}}$ the hull number associated to the cycle-convexity interval f…
Conjectureopengraph-convexity knot-theory link-theoryarXiv posted 2 days ago
0 votes0 replies1 view
NP-completeness conjecture for convex p-partitions of bipartite graphs
NP-completeness conjecture. For bipartite graphs and fixed $p\geq 2$ , it should be NP-complete to decide whether the graph has a convex $p$ -partition.
Conjectureopenbipartite-graphs computational-complexity graph-convexityarXiv posted 2 days ago

Gaetz–Gao's strong hull conjecture for Coxeter groups