The List Edge Colouring Conjecture asserts that, given any multigraph G with chromatic index k and any set system fSe : e 2 E(G)g with each jSej = k, we can choose elements se 2 Se such that se 6 = sf whenever e and f are adjacent edges. Using a technique of Alon and Tarsi which involves the graph monomial Q fxu ? xv : uv 2 Eg of an oriented graph, we verify this conjecture for certain families...

A double sequence x = {xk,l} of points in R is slowly oscillating if for any given ε > 0, there exist α = α(ε) > 0, δ = δ(ε) > 0, and N = N(ε) such that |xk,l−xs,t| < ε whenever k, l ≥ N(ε) and k ≤ s ≤ (1 + α)k, l ≤ t ≤ (1 + δ)l. We study continuity type properties of factorable double functions defined on a double subset A × A of R into R, and obtain interesting results related to uniform cont...

We study the so-called factorable surfaces in pseudo-Galilean space, graphs of product two functions one variable. then classify these when mean and Gaussian curvatures are