Campus Event Calendar: Jane Gao (02/18/2011 in E1 4/024)

Campus Event Calendar

Campus Event Calendar:
- All Upcoming:
  - only for D1
  - only for D2
  - only for INET
  - only for D4
  - only for D5
  - only for D6
  - only for RG1
  - Mailing Lists
  - by Speaker
  - by Type
  - by Category
  - by Title
  - Calendar
  - RSS Feed
- History of Events:

Event Entry

What and Who

Some (open) problems in geometric combinatorics

Jane Gao

Max-Planck-Institut für Informatik - D1

AG1 Mittagsseminar (own work)

AG 1

AG Audience

English

Note: We use this to send email in the morning.

Date, Time and Location

Friday, 18 February 2011

13:00

30 Minutes

E1 4

024

Saarbrücken

Abstract

TBA

Contact

Jane Gao

--email hidden

System used:

Meeting URL:

Meeting ID:

Passcode:

passcode not visible

Code Visible for:

logged in users only

Tags, Category, Keywords and additional notes

Note:

A geometric graph is a graph drawn in the plane such that the vertex set is a set of (non-colinear) points and every edge is a straight-line segment joining two vertices. In this talk I will discuss a few known results on ramsey-type problems for geometric graphs and some conjectures and recent progress towards these conjectures. This talk will be given informally.

Jane Gao, 02/17/2011 11:10
Jane Gao, 01/31/2011 13:01
Jane Gao, 01/31/2011 12:59 -- Created document.

Imprint / Impressum | Data Protection / Datenschutzhinweis