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

Unfriendly Partitions of Graphs

  • Start Date: February 21, 2024
  • Event Start Time: 12:15 PM
  • Event End Time: 1:15 PM
  • Seminar Series: Graduate Combinatorics Seminar
  • Presenter(s): Caleb Fong - Rutgers University
  • Event Location: Mathematics Graduate Student Lounge -- 7th Floor | Rutgers University | Hill Center | Mathematics Department
  • Event Additional Info: <p>See:&nbsp;<a href="https://sites.math.rutgers.edu/~kmg326/GCS/GCS.html">https://sites.math.rutgers.edu/~kmg326/GCS/GCS.html</a></p>
  • Presentation Type: Stand Alone Presentation
  • Abstract:

    The Unfriendly Partition Conjecture posits that every countable graph can be bipartitioned in such a way that each vertex has more neighbours outside its own part (i.e., has an unfriendly partition). This is still wide open, so I will also talk about some variations of this study in the context of directed graphs and list colouring. We will hopefully encounter different flavours of proof (compactness, probabilistic, linear algebraic) and several open problems.