S. Bakalarski

collaborators

2 papers

math.CO2015

On path sequences of graphs

Sławomir Bakalarski, Jakub Zygadło

A subset $S$ of vertices of a graph $G = (V, E)$ is called a $k$ -path vertex cover if every path on $k$ vertices in $G$ contains at least one vertex from $S$ . Denote by $ψ_{k} (G)$ the m…

math.AG2007

Irreducibility of the symmetric Yagzhev's maps

S. Bakalarski

Let $F:\Cn \to \Cn$ be a polynomial mapping in Yagzhev's form,i.e. $$F(x_1,\ld,x_n)=(x_1+H_1(x_1,\ld,x_n),\ld,x_n+H_n(x_1,\ld,x_n)),$$ where $H_{i}$ are homogenous polynomials of deg…