Tutte seminar - Penny HaxellExport this event to calendar

Friday, April 5, 2013 — 3:30 PM to 4:30 PM EDT

Extremal hpergraphs for packing and covering

Speaker: Penny Haxell
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract:

A packing (or matching) in a hypergraph H is a set of pairwisedisjoint edges of H. A cover of H is a set C of vertices that meets all edges of H. A famous open problem known as Ryser's Conjecture states that any r-partite r-uniform hypergraph should have a cover of size at most $(r-1)\nu(H)$, where $\nu(H)$ denotes the size of a largest packing in H. This was proved by Aharoni in 2001 for the case r=3. Here we show that if equality holds in this case then H belongs to a special class of hypergraphs we call "home base hypergraphs''. To prove this we need to establish some auxiliary results on connectedness of the matching complex of bipartite graphs.

Joint work with L. Narins and T. Szabó.

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

Waterloo, ON N2L 3G1
Canada

S M T W T F S
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
1
  1. 2022 (110)
    1. October (2)
    2. September (10)
    3. August (2)
    4. July (17)
    5. June (17)
    6. May (10)
    7. April (12)
    8. March (18)
    9. February (10)
    10. 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)