Extensions of cyclically monotone mappings
Some remarks on Ramsey matroids
Coloring digraphs by iterated antichains
We show that the minimum chromatic number of a product of two -chromatic graphs is either bounded by 9, or tends to infinity. The result is obtained by the study of coloring iterated adjoints of a digraph by iterated antichains of a poset.
A note on stable sets and colorings of graphs
Maximum rank of a power of a matrix of a given pattern
Amalgamation over uniform matroids
Orthogonal partitions and covering of graphs
On classes of graphs determined by forbidden subgraphs
A note on dimension of
On a facet of the balanced subgraph polytope
On the complexity of the subgraph problem
On amalgamation of graphs and essential sets of generators
Three-linking in Eulerian digraphs
Eigenvalues and the max-cut problem
Representing graphs by means of strong and weak products
On systems, periods and semipositive mappings
On the union of matching matroids
Extensions of -subsets to -subsets - existence versus constructability
Note on homomorphism interpolation theorem
Limit behaviour of trajectories involving subgradients of convex functions
Page 1 Next