Expressing graphs as symmetric differences of cliques of the complete graph

Document Type

Presentation Abstract

Presentation Date

3-1-2021

Abstract

Any finite simple graph G=(V, E) can be represented by a collection C of subsets of V such that uv∈E if and only if u and v appear together in an odd number of sets in C . We are interested in the minimum cardinality of such a collection. In this talk, we will discuss properties of this invariant and its close connection to the minimum rank problem. This talk will be accessible to students. Joint work with Calum Buchanan and Christopher Purcell.

Additional Details

March 1, 2021 at 3:00 p.m. via Zoom

This document is currently not available here.

Share

COinS