-
Consider the following hat guessing game:
42 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,
-
A theoretical dynamical system is a pair (X,T) where X is a compact metric space and T is a self homeomorphism of X. The topological entropy of a theoretical dynamical system (X,T), first introduced in 1965 by Adler, Konheim and McAndrew, is a nonnegative real number that measures the complexity of the system. Systems with positive … |
0 events,
|
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
1 event,
-
The well-known 1-2-3 Conjecture by Karoński, Łuczak and Thomason states that the edges of any connected graph with at least three vertices can be assigned weights 1, 2 or 3 so that for each edge |
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
1 event,
-
In a rainbow variant of the Turán problem, we consider |
0 events,
|
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
1 event,
-
A loose cycle is a cyclic ordering of edges such that every two consecutive edges share exactly one vertex. A cycle is Hamilton if it spans all vertices. A codegree of a |
0 events,
|
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
0 events,
|
1 event,
-
Ramsey's Theorem guarantees for every graph H that any 2-edge-coloring of a sufficiently large complete graph contains a monochromatic copy of H. As probabilistic constructions often provide good bounds on quantities in extremal combinatorics, we say that a graph H is common if the random 2-edge-coloring asymptotically minimizes the number of monochromatic copies of H. … |
0 events,
|
0 events,
|
0 events,
|