Art of graph drawing and art.
Hales-Jewett's theorem without short cycles
Some remarks on Ramsey matroids
Rainbow Ramsey theory.
On Symmetric and Antisymmetric Relations.
Historická perspektiva konečné matematiky
Kombinatorické konstrukce, jejich složitost a praktický význam
O studentském semináři z teorie grafů na Matematicko-fyzikální fakultě KU
László Lovász a jeho matematika (Abelova cena za rok 2021)
Tento článek je napsán u příležitosti udělení Abelovy ceny za rok 2021 László Lovászovi.
Graphs with small asymmetries
Every group is a maximal subgroup of the semigroup of relations
-хроматические графы вез циклов длины
On reconstructing of infinite forests
Riga -point
On uniquely colorable graphs without short cycles
Infinite precise objects
A few remarks on the history of MST-problem
On the background of Borůvka’s pioneering work we present a survey of the development related to the Minimum Spanning Tree Problem. We also complement the historical paper Graham-Hell [GH] by a few remarks and provide an update of the extensive literature devoted to this problem.
Combinatorics and quantifiers
Let be the set of subsets of of cardinality . Let be a coloring of and a coloring of . We write if every -homogeneous is also -homogeneous. The least such that for some is called the of and denoted by . In the first part of the paper we prove the existence of colorings with high -width. In particular, we show that for each and there is a coloring with . In the second part of the paper we give applications of wide colorings in the theory of generalized quantifiers....
On maximal finite antichains in the homomorphism order of directed graphs
We show that the pairs where T is a tree and its dual are the only maximal antichains of size 2 in the category of directed graphs endowed with its natural homomorphism ordering.
Práce Vojtěcha Jarníka v kombinatorické optimalizaci
Page 1 Next