The Orthogonal Colouring Game The Orthogonal Colouring Game is a combinatorial game in which two players alternately colour vertices of a pair of isomorphic graphs while respecting the properness and the orthogonality of the colouring. Each player aims to maximize

Reconfiguration for Dominating Sets Given a problem and a set of feasible solutions to that problem, the associated  reconfiguration problem involves determining whether one feasible solution to the original problem can be transformed to a different feasible solution through a

In this talk, I will show regions that contain no complex zeros the edge-cover polynomials of hypergraphs. The edge cover polynomial of a graph $G$ is the generating function of edges that covers $V(G)$. It is known that the zeros

About a year ago Jason Brown spoke in our seminar (of the university of Amsterdam) about the two-terminal reliability polynomial and left us with some questions about the closure of the complex zeros of all such polynomials (the zero-locus). In

We study the algebraic connectivity for several classes of random semi-regular graphs. For large random semi-regular bipartite graphs, we explicitly compute both their algebraic connectivity and as well as the full spectrum distribution. For an integer d in , we

Extremal questions for vertex colorings of graphs For graphs $G$ and $H$, an $H$-coloring of $G$ is a map from the vertices of $G$ to the vertices of $H$ so that an edge in $G$ is mapped to an edge

Graph polynomials In this talk, I will discuss various aspects of several graph polynomials such as the location of their roots, their combinatorial properties and extremal questions. Join Zoom Meeting: link

An Unsupervised Framework for Comparing Graph Embeddings The goal of many machine learning applications is to make predictions or discover new patterns using graph-structured data as feature information. In order to extract useful structural information from graphs, one might want

Conditions for perfect matchings in random sparse bipartite graphs Given a uniformly random sparse matrix A, with specified number of nonzero entries in columns and rows, we determine when A has full row rank over a finite field. As a