Combinatorics

  • 2020 Jul 27

    Combinatorics: Doron Puder (TAU)

    2:00pm to 4:00pm

    Location: 

    https://huji.zoom.us/j/97269425447?pwd=TFhuUkhBYTJsa3BvNzJyZHFBMlZqZz09
    Speaker: Doron Puder (TAU)

    Title: Random permutations sampled by surface groups
  • 2020 Jul 20

    Combinatorics: Daniel Kalmanovich (HUJI)

    2:00pm to 4:00pm

    Location: 

    Zoom
    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.
  • 2020 Jul 13

    Combinatorics: Edinah K. Gnang (JHU)

    2:00pm to 4:00pm

    Location: 

    Zoom
    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.
  • 2020 Jul 06

    Combinatorics: Xinyu Wu (CMU)

    2:00pm to 4:00pm


    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.
  • 2020 Jun 29

    Combinatorics:

    Repeats every week every Monday until Mon Jun 29 2020 except Mon Apr 06 2020.
    11:00am to 1:00pm

    Location: 

    Manchester 110

    Speaker: TBA

    Title: TBA

    Abstract: TBA
  • 2020 Jun 29

    Combinatorics: Dan Hefez (Ariel)

    11:00am to 1:00pm

    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.

  • 2020 Jun 22

    Combinatorics: Lukas Kuhne (HUJI)

    11:00am to 1:00pm


    Speaker: Lukas Kuhne (HUJI)

    Title:  Matroids doing Algebra

    Abstract:

    A matroid  is a combinatorial object based on an abstraction of linear independence in vector spaces and forests in graphs. It is a classical question to determine whether a given matroid is representable as a vector configuration over a field. Such a matroid is called linear.

Pages