The Ramsey number
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,
-
Recently, Letzter proved that any graph of order n contains a collection P of |
0 events,
|
1 event,
-
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,
-
We study the fundamental problem of finding small dense subgraphs in a given graph. For a real number |
1 event,
-
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,
-
The Erdős-Sós conjecture states that the maximum number of edges in an |
0 events,
|
0 events,
|
0 events,
|
0 events,
|