-
Rob Morris, An exponential improvement for diagonal Ramsey
Rob Morris, An exponential improvement for diagonal Ramsey
The Ramsey number
35 events found.
Seminars and Colloquiums
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,
1 event,
-
Maria Chudnovsky, Induced subgraphs and tree decompositions
Maria Chudnovsky, Induced subgraphs and tree decompositions
Tree decompositions are a powerful tool in both structural graph theory and graph algorithms. Many hard problems become tractable if the input graph is known to have a tree decomposition of bounded “width”. Exhibiting a particular kind of a tree decomposition is also a useful way to describe the structure of a graph. Tree decompositions …
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
1 event,
-
Szymon Toruńczyk, Flip-width: Cops and Robber on dense graphs
Szymon Toruńczyk, Flip-width: Cops and Robber on dense graphs
We define new graph parameters, called flip-width, that generalize treewidth, degeneracy, and generalized coloring numbers for sparse graphs, and clique-width and twin-width for dense graphs. The flip-width parameters are defined using variants of the Cops and Robber game, in which the robber has speed bounded by a fixed constant r∈N∪{∞}, and the cops perform flips …
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