Let
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,
-
Given an undirected planar graph |
0 events,
|
1 event,
-
A subset |
0 events,
|
0 events,
|
0 events,
|
0 events,
|
1 event,
-
We give a summary on the work of the last months related to Frankl's Union-Closed conjecture and its offsprings. The initial conjecture is stated as a theorem in extremal set theory; when a family F is union-closed (the union of sets of F is itself a set of |
0 events,
|
1 event,
-
In 1977, Erdős and Hajnal made the conjecture that, for every graph |
0 events,
|
0 events,
|
0 events,
|
0 events,
|
1 event,
-
Extremal Combinatorics studies the maximum or minimum size of finite objects (numbers, sets, graphs) satisfying certain properties. In this talk, I introduce the conjectures I solved on Extremal Combinatorics, and also introduce recent extremal problems. |
1 event,
-
In 1993, Erdős, Hajnal, Simonovits, Sós and Szemerédi proposed to determine the value of Ramsey-Turán density |
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
1 event,
-
In this talk, we will discuss the problem of determining the maximum number of edges in an n-vertex k-critical graph. A graph is considered k-critical if its chromatic number is k, but any proper subgraph has a chromatic number less than k. The problem remains open for any integer k ≥ 4. Our presentation will … |
0 events,
|
0 events,
|
0 events,
|
0 events,
|