Thursday, February 27, 2014 — 1:00 PM EST

Extensions of Signed Graphs

Speaker: Katherine Naismith
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract: 

A signed graph is a pair (G, S), where S is a subset of E(G). We can extend a signed graph by adding (i.e. un-deleting) edges, or by splitting vertices (i.e. un-contracting edges). This talk will address two main questions about extensions of signed graphs. The rst is: How can we minimally extend an embedded signed graph so as to "break" its embedding? The second question is related: When does an embedded signed graph extend uniquely? These results represent a step toward a characterization theorem for signed graphs with no odd-K5minor.

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

Waterloo, ON N2L 3G1
Canada

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