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

Canonical Ramsey Numbers for Edge-Ordered Hypergraphs

  • Start Date: November 18, 2019
  • Event Start Time: 2:00 PM
  • Event End Time: 3:00 PM
  • Seminar Series: Rutgers Discrete Mathematics Seminar
  • Presenter(s): Mathias Schacht - Yale University
  • Event Location: Hill Center-Room 705
  • Presentation Type: Stand Alone Presentation
  • Abstract:

    We consider quantitative aspects of a Ramsey theoretic result of Leeb. Leeb showed that any sufficiently large complete k-uniform hypergraph with ordered vertex set and ordered edge set must contain one of k!2^k "canonical" subhypergraphs on a given number (say m) of vertices. We obtain estimates for the corresponding Ramsey numbers. In particular, we show that for graphs these Ramsey numbers grow doubly exponential in m. For general hypergraphs the obtained lower and upper bound differ in the height of the tower functions by 2.

     

    This is joint work with M. Tadeu Sales, Chr. Reiher, and V. Rödl.