기초과학연구원 이산수학그룹
|
S
Sun
|
M
Mon
|
T
Tue
|
W
Wed
|
T
Thu
|
F
Fri
|
S
Sat
|
|---|---|---|---|---|---|---|
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
1 event,
-
The uniform Turán density $\pi_u(F)$ of a hypergraph $F$, introduced by Erdős and Sós, is the smallest value of $d$ such that any hypergraph $H$ where all linear-sized subsets of vertices of $H$ have density greater than $d$ contains $F$ as a subgraph. Over the past few years the value of $\pi_u(F)$ was determined for … |
0 events,
|
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
0 events,
|
1 event,
-
We prove the existence of a computable function $f\colon\mathbb{N}\to\mathbb{N}$ such that for every integer $k$ and every digraph $D$ either contains a collection $\mathcal{C}$ of $k$ directed cycles of even length such that no vertex of $D$ belongs to more than four cycles in $\mathcal{C}$, or there exists a set $S\subseteq V(D)$ of size at … |
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,
-
There has been a raising interest on the study of perfect matchings in uniform hypergraphs in the past two decades, including extremal problems and their algorithmic versions. I will introduce the problems and some recent developments. |
0 events,
|
0 events,
|
0 events,
|
0 events,
|