From independent sets and vertex colorings to isotropic spaces and isotropic decompositions

by   Xiaohui Bei, et al.

In the 1970's, Lovász built a bridge between graphs and alternating matrix spaces, in the context of perfect matchings (FCT 1979). A similar connection between bipartite graphs and matrix spaces plays a key role in the recent resolutions of the non-commutative rank problem (Garg-Gurvits-Oliveira-Wigderson, FOCS 2016; Ivanyos-Qiao-Subrahmanyam, ITCS 2017). In this paper, we lay the foundation for another bridge between graphs and alternating matrix spaces, in the context of independent sets and vertex colorings. The corresponding structures in alternating matrix spaces are isotropic spaces and isotropic decompositions, both useful structures in group theory and manifold theory. We first show that the maximum independent set problem and the vertex c-coloring problem reduce to the maximum isotropic space problem and the isotropic c-decomposition problem, respectively. Next, we show that several topics and results about independent sets and vertex colorings have natural correspondences for isotropic spaces and decompositions. These include algorithmic problems, such as the maximum independent set problem for bipartite graphs, and exact exponential-time algorithms for the chromatic number, as well as mathematical questions, such as the number of maximal independent sets, and the relation between the maximum degree and the chromatic number. These connections lead to new interactions between graph theory and algebra. Some results have concrete applications to group theory and manifold theory, and we initiate a variant of these structures in the context of quantum information theory. Finally, we propose several open questions for further exploration. This paper is dedicated to the memory of Ker-I Ko.


Maximum Independent Sets in Subcubic Graphs: New Results

The maximum independent set problem is known to be NP-hard in the class ...

Connections between graphs and matrix spaces

Given a bipartite graph G, the graphical matrix space 𝒮_G consists of ma...

Counting weighted independent sets beyond the permanent

In a landmark paper, Jerrum, Sinclair and Vigoda (2004) showed that the ...

Supercards, Sunshines and Caterpillar Graphs

The vertex-deleted subgraph G-v, obtained from the graph G by deleting t...

Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs

We give deterministic distributed (1+ϵ)-approximation algorithms for Min...

On an Annihilation Number Conjecture

Let α(G) denote the cardinality of a maximum independent set, while μ(G)...

Compositional Algorithms on Compositional Data: Deciding Sheaves on Presheaves

Algorithmicists are well-aware that fast dynamic programming algorithms ...

Please sign up or login with your details

Forgot password? Click here to reset