기초과학연구원 이산수학그룹
|
S
Sun
|
M
Mon
|
T
Tue
|
W
Wed
|
T
Thu
|
F
Fri
|
S
Sat
|
|---|---|---|---|---|---|---|
|
0 events,
|
0 events,
|
1 event,
-
Dirac's theorem determines the sharp minimum degree threshold for graphs to contain perfect matchings and Hamiltonian cycles. There have been various attempts to generalize this theorem to hypergraphs with larger uniformity by considering hypergraph matchings and Hamiltonian cycles. We consider another natural generalization of the perfect matchings, Steiner triple systems. As a Steiner triple system … |
0 events,
|
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
1 event,
-
For |
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
1 event,
-
Given a set of lines in |
0 events,
|
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
1 event,
-
A graph is |
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,
-
We present the KKM theorem and a recent proof method utilizing it that has proven to be very useful for problems in discrete geometry. For example, the method was used to show that for a planar family of convex sets with the property that every three sets are pierced by a line, there are three … |
0 events,
|
0 events,
|
0 events,
|
0 events,
|