Graph theory seminar - Jim Geelen Export this event to calendar

Wednesday, April 2, 2014 — 3:30 PM EDT

Structure in Dense Triangle-free Graphs Part 1

Speaker: Jim Geelen
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 6486

Abstract:

Brandt and Thomass\’ e proved that every $n$-vertex triangle-free graph with minimum degree greater than $\frac 1 3 n$ is $4$-colourable. On the other hand, Hijnal proved that, for each $\epsilon>0$, there are triangle-free graphs with minimum degree greater than $(\frac 1 3 - \epsilon)n$ that have arbitrarily large chromatic number. The proof of Brandt and Thomass\’ e’s result is quite hard, but there are a number of related results with very nice proofs that I will explain.
None of the results or proofs that I will present are original.

Location 
MC - Mathematics & Computer Building
6486
200 University Avenue West

Waterloo, ON N2L 3G1
Canada

S M T W T F S
29
30
31
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
1
2
  1. 2021 (91)
    1. October (3)
    2. September (12)
    3. August (7)
    4. July (10)
    5. June (12)
    6. May (7)
    7. April (9)
    8. March (13)
    9. February (8)
    10. January (10)
  2. 2020 (119)
    1. December (5)
    2. November (12)
    3. October (12)
    4. September (12)
    5. August (11)
    6. July (17)
    7. June (11)
    8. May (6)
    9. March (11)
    10. February (11)
    11. January (11)
  3. 2019 (167)
  4. 2018 (136)
  5. 2017 (103)
  6. 2016 (137)
  7. 2015 (136)
  8. 2014 (88)
  9. 2013 (48)
  10. 2012 (39)
  11. 2011 (36)
  12. 2010 (40)
  13. 2009 (40)
  14. 2008 (39)
  15. 2007 (15)