Ela on the Strong Arnol’d Hypothesis and the Connectivity of Graphs

Abstract

In the definition of the graph parameters μ(G) and ν(G), introduced by Colin de Verdière, and in the definition of the graph parameter ξ(G), introduced by Barioli, Fallat, and Hogben, a transversality condition is used, called the Strong Arnol’d Hypothesis. In this paper, we define the Strong Arnol’d Hypothesis for linear subspaces L ⊆ R with respect to a… (More)

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics