-
Rob Morris, An exponential improvement for diagonal Ramsey
Rob Morris, An exponential improvement for diagonal Ramsey
The Ramsey number
35 events found.
Discrete Math Seminar
Calendar of Events
S Sun
M Mon
T Tue
W Wed
T Thu
F Fri
S Sat
0 events,
0 events,
1 event,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
1 event,
-
Jozef Skokan, Separating the edges of a graph by a linear number of paths
Jozef Skokan, Separating the edges of a graph by a linear number of paths
Recently, Letzter proved that any graph of order n contains a collection P of
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
1 event,
-
Oliver Janzer, Small subgraphs with large average degree
Oliver Janzer, Small subgraphs with large average degree
We study the fundamental problem of finding small dense subgraphs in a given graph. For a real number
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
1 event,
-
Suyun Jiang (江素云), How connectivity affects the extremal number of trees
Suyun Jiang (江素云), How connectivity affects the extremal number of trees
The Erdős-Sós conjecture states that the maximum number of edges in an