Nathanson Heights and the CSS Conjecture for Cayley Graphs
Nathanson Heights and the CSS Conjecture for Cayley Graphs
Let G be a finite directed graph, \beta(G) the minimum size of a subset X of edges such that the graph G'=(V, E / X) is directed acyclic and \gamma(G) the number of pairs of nonadjacent vertices in the undirected graphobtained from G by replacing each directed edge with an …