Current students

Title: The coloring problem for restricted graph classes

Abstract:

Let L be a set of graphs. Free(L) is the set of graphs that do not contain any graph in L as an induced subgraph.

Title: The Many Faces of Circulation Algebras

Abstract:  The circulation algebra is a commutative graded algebra associated to a graph, introduced by Wagner in 1998 to study flows.

Title: The c₂ invariant at p=2 by counting edge bipartitions

Abstract:

Since no one provided a visitor or volunteered for this week, I will explain how to prove a special case of a conjecture about the c₂ invariant. 

Title: Stretching drawings of graphs

Abstract: Given a drawing D of a graph (where vertices are dots in the plane and edges are arbitrary curves connecting some pairs of dots),

Title: Two-level polytopes

Abstract:

This talk is dedicated to two-level polytopes. On one side, two-level polytopes form a well structured family of polytopes.

Title: Minimization of convex compositions

Abstract:

Numerous optimization tasks can be posed as minimization of a finite convex function composed with a smooth map. Phase retrieval and matrix factorization problems are common examples.

Title: The price of connectivity for domination

Abstract: The price of connectivity for dominating set in a graph G is the ratio between the minimum sizes of a connected dominating set and a dominating set of G.

Title: Distributed coloring in planar graphs

Abstract:

We are concerned with efficiently coloring sparse graphs in the distributed setting with as few colors as possible. According to the celebrated Four Color Theorem, planar graphs can be colored with at most 4 colors, and the proof gives a (sequential) quadratic algorithm finding such a coloring.

Title: Hamilton cycles in cubic planar graphs

Abstract: Tait conjectured in 1884 that each cubic planar graph contains a Hamilton cycle. Had the conjecture been true,