Speaker: Daniel Kalmanovich (HUJI)
Title: Cubical polytopes
Abstract:
Convex polytopes have fascinated people for ages, and questions about their combinatorics and their geometry have been widely studied.
Speaker: Edinah K. Gnang (JHU)
Title: On the Kotzig-Ringel-Rosa conjecture
Abstract:
In this talk we describe and motivate the K.R.R. conjecture and describe a functional graph theoretic approach enabling us to tackle the K.R.R. conjecture via a composition lemma.
Speaker: Xinyu Wu (CMU)
Title: Explicit near-fully X-Ramanujan graphs
Abstract:
In this talk I will introduce constructions of finite graphs which resemble some given infinite graph both in terms of their local neighborhoods, and also their spectrum.
Abstract: I will discuss a quantitative equidistribution result for the random walk on a torus arising from the action of the group of affine transformations. This is a joint work with Weikun He and Elon Lindenstrauss.
In this talk we will study the so-called perturbed model which is a graph distribution of the form G \cup \mathbb{G}(n,p), where G is an n-vertex graph with edge-density at least d > 0, and d is independent of n.
We are interested in the threshold of the following anti-Ramsey property: every proper edge-colouring of G \cup \mathbb{G}(n,p) yields a rainbow copy of K_s. We have determined this threshold for every s.
Based on joint work with Elad Aigner-Horev, Oran Danon and Shoham Letzter.
