On the limiting distribution for the length of the longest alternating sequence in a random permutation.
On the line graph of the square and the square of the line graph of a connected graph
On the local linear independence of translates of a box spline
On the locality of the Prüfer code.
On the lower bound for the chromatic number of graphs with given maximal degree and girth.
On the LU Factorization of M-Matrices.
On the -basis of a digraph
On the maximum automorphism group of self-complementary graphs
On the maximum average degree and the incidence chromatic number of a graph.
On the Maximum Eigenvalue of a Reducible Non-Negative Real Matrix.
On the Maximum Genus of Some Graphs With Upper Imbeddable Subgraphs..
On the maximum number of arcs in some classes of graphs
On the Maximum of a Branching Process Conditioned on the Total Progeny
The maximum M of a critical Bienaymé-Galton-Watson process conditioned on the total progeny N is studied. Imbedding of the process in a random walk is used. A limit theorem for the distribution of M as N → ∞ is proved. The result is trasferred to the non-critical processes. A corollary for the maximal strata of a random rooted labeled tree is obtained.
On the maximum positive semi-definite nullity and the cycle matroid of graphs.
On the measurement of the (non)linearity of Costas permutations.
On the minimal basis of the spindle-surface .
On the minimal length of the longest trail in a fixed edge-density graph
A nearly sharp lower bound on the length of the longest trail in a graph on n vertices and average degree k is given provided the graph is dense enough (k ≥ 12.5).
On the minimum degree and edge-connectivity of a graph
On the minimum number of components in a cotree of a graph
On the minimum number of vertices and edges in a graph with a given number of spanning trees