dimacs logo color

Events

Event Calendar

« Previous Month

August 2026

Next Month »
Sun Mon Tue Wed Thu Fri Sat
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31

Seminar Details

Matchings in Graphs

  • Start Date: June 10, 2010
  • Event Start Time: 10:30 AM
  • Event End Time: 11:30 AM
  • Organizers: Gene Fiorini
  • Seminar Series: REU Seminar
  • Presenter(s): Daniel Kral - Charles University, Prague
  • Event Location: DIMACS Seminar room
  • Abstract: The talk will be focused on one of the most intesively studied notions in structural graph theory and optimization - matchings in graphs. We recall a well-known conjecture of Lovasz and Plummer from the 1960's on the number of perfect matchings in cubic bridgeless graphs and overview recent progress on it. We also relate the existence of special matchings in planar graphs to the Four Color Theorem, one of the most famous results in graph theory, and present a proof of a particular case of the conjecture of Lovasz and Plummer which is motivated by applications in chemistry. The talk will be self-contained assuming no previous knowledge of any concepts from graph theory.