V tomto příspěvku seznamuje Jan Randák s šestým ročníkem Letní školy soudobých dějin, který byl jako tradičně určen v prvé řadě učitelům druhých stupňů základních škol a vyučujícím na středních školách. Ve dnech 24. až 26. června 2013 jej v Praze uspořádalo Středisko společných činností Akademie věd ČR spolu s Ústavem českých dějin Filozofické fakulty Univerzity Karlovy. and Jan Randák.
Czech Scientists have received a four year research project (2011-2014), enabling them to continue in their research activities focused on slope stability and phenomena of the glacial lakes outburst flood in the majestic Cordillera Blanca in Peru. Previous research as well as the new project is supported by Peruvian colleagues from Autoridad Nacional Del Agua, Unidad de Glaciologia y Recursos Hidricos, Huaraz. The project will study four topics: spatial and temporal occurrence of landslides; stability calculations of dangerous slopes; GLOF extent modeling; and multi hazard maps preparation. and Jan Klineš, Vít Vilímek, Miroslava Benešová a Petr Bouška.
For a nontrivial connected graph G, let c : V (G) → N be a vertex coloring of G where adjacent vertices may be colored the same. For a vertex v ∈ V (G), the neighborhood color set NC(v) is the set of colors of the neighbors of v. The coloring c is called a set coloring if NC(u) 6= NC(v) for every pair u, v of adjacent vertices of G. The minimum number of colors required of such a coloring is called the set chromatic number χs(G). We show that the decision variant of determining χs(G) is NP-complete in the general case, and show that χs(G) can be efficiently calculated when G is a threshold graph. We study the difference χ(G) − χs(G), presenting new bounds that are sharp for all graphs G satisfying χ(G) = ω(G). We finally present results of the Nordhaus-Gaddum type, giving sharp bounds on the sum and product of χs(G) and χs(G).
For a nontrivial connected graph $G$, let $c\: V(G)\to \Bbb N$ be a vertex coloring of $G$ where adjacent vertices may be colored the same. For a vertex $v$ of $G$, the neighborhood color set ${\rm NC}(v)$ is the set of colors of the neighbors of $v$. The coloring $c$ is called a set coloring if ${\rm NC}(u)\ne {\rm NC}(v)$ for every pair $u,v$ of adjacent vertices of $G$. The minimum number of colors required of such a coloring is called the set chromatic number $\chi _s(G)$. A study is made of the set chromatic number of the join $G + H$ of two graphs $G$ and $H$. Sharp lower and upper bounds are established for $\chi _s(G+H)$ in terms of $\chi _s(G)$, $\chi _s(H)$, and the clique numbers $\omega (G)$ and $\omega (H)$.
A meeting of the Visegrad Group of Academies was held in Třešť on September 23-24 and was hosted by Academy of Sciences of the Czech Republic. The Visegrad Group of Academies was initiated in March 2000 by the Slovak Academy of Sciences which organized the first meeting of the representatives of the V4 Academies in Bratislava. and Robert Zika.
Cancellor Angela Merkel visited on August, 25, 2016, the Czech Republic at the invitation of the Czech Premier Bohuslav Sobotka. One of the topics of their discussion were also modern technologies, expecially the industrial digitalization. After their meeting at the Office of the Government, Chancellor participate in a debate about Czech-German cooperation in the field of research and development, which was attended by representatives of enterprises and research facilities and where dshe met her former colleagues Professor Rudolf Zahradník and Zdeněk Havlas from the Institute of organic chemistry and biochemistry of the CAS., lsd., and Autor je podepsaný šifrou "lsd".
The desire to explore distant lands and exotic civilisations is a
defining attribute of one of our most famous travellers, Enrique Stanko Vráz (b. 1860 - d. 1932). Besides being a traveller, he was also a photographer, writer and collector. We learn most about his journeys from his books, in which his travel experiences were transmuted into literature, and from the countless photographs taken while staying in exotic countries. Vráz understood
photography to be the perfect means of documenting facts and events; he always preferred an informative to an emotional style. His captions written on glass negatives are of exceptional value.
Vráz would always try to describe and, more importantly, understand
the culture of any country he visited. He himself was a very
charismatic personality with an ability to make friends easily - which is why he was able to find out things that for other travellers and explorers would remain secret. His approach to people from other cultures was open-minded and friendly, but also carried a dose of healthy scepticism.