Session 6: Discrete Mathematics

ORG: Kolja Knauer

Thursday 16:30 - 19:00 at room Pi i Sunyer

  • 16:30 Felipe Rincón (Queen Mary U. London)
  • 17:20 Vincent Pilaud (UB)
  • 18:10 Fiona Skerman (Uppsala U. , Suecia)
    • Is it easier to count communities than find them? (abstract)

 

 Friday 16:00 - 18:30 at room Pi i Sunyer

  • 16:00 Amanda Montejano (U. Nacional Autónoma de México)
    • Unavoidable patterns in 2-edge colorings of the complete graph (abstract)
  • 16:50 Alexandra Wesolek (Technische U. BerlIn)
    • Extremal graphs in the generalized Turán problem (abstract)
  • 17:40 Ignacio García Marco (U. De la Laguna)
    • Sensitivity in Cayley graphs (abstract)