2 Results Found

A graph G is said to be perfect if $\omega \left(H\right)=\chi \left(H\right)$ for every induced subgraph H of G, where $\omega \left(H\right)$ and $\chi \left(H\right)$ denote the clique number and the chromatic number of H. We say that a graph G admits a perfect division if its vertex set can be p...

Background: Cryptocurrency allocation tools that use graph learning are often judged on gross performance and rarely stress-tested under realistic trading frictions. Methods: We evaluate a regime-supervised graph-neural tangency pipeline on 33 large-...