On an expansion theorem in the finite operator calculus of G.-C. Rota.
On an extension of Euler numbers and records of alternating permutations. (Sur une extension des nombres d'Euler et les records des permutations alternantes.)
On an extremal characterization of partitions
On an extremal problem concerning graphs (Preliminary communication)
On an extremal problem in graph theory
On An Extremal Problem In The Class Of Bipartite 1-Planar Graphs
A graph G = (V, E) is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite 1-planar graphs with prescribed numbers of vertices in partite sets. Bipartite 1-planar graphs are known to have at most 3n − 8 edges, where n denotes the order of a graph. We show that maximal-size bipartite 1-planar graphs which are almost balanced have not significantly fewer edges than indicated by this upper bound, while the same is not true...
On an identity for the cycle indices of rooted tree automorphism groups.
On an integer sequence related to a product of trigonometric functions, and its combinatorial relevance.
On an open problem of Green and Losonczy: exact enumeration of freely braided permutations.
On another extension of -Pfaff-Saalschütz formula
In this paper we give an extension of -Pfaff-Saalschütz formula by means of Andrews-Askey integral. Applications of the extension are also given, which include an extension of -Chu-Vandermonde convolution formula and some other -identities.
On approximation of amenable groups by finite quasigroups.
On Arbitrarily Traceable Graphs.
On arbitrarily vertex decomposable unicyclic graphs with dominating cycle
A graph G of order n is called arbitrarily vertex decomposable if for each sequence (n₁,...,nₖ) of positive integers such that , there exists a partition (V₁,...,Vₖ) of vertex set of G such that for every i ∈ 1,...,k the set induces a connected subgraph of G on vertices. We consider arbitrarily vertex decomposable unicyclic graphs with dominating cycle. We also characterize all such graphs with at most four hanging vertices such that exactly two of them have a common neighbour.
On arc-coloring of subcubic graphs.
On Arrangements of Jordan Arcs with Three Intersections per Pair.
On asymptotic stability of passive linear electrical networks
On automatic infinite permutations∗
An infinite permutation α is a linear ordering of N. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this paper, we try to extend to permutations the notion of automaticity. As we shall show, the standard definitions which are equivalent in the case of words are not equivalent in the context of permutations. We investigate the relationships...
On automatic infinite permutations
An infinite permutation α is a linear ordering of N. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this paper, we try to extend to permutations the notion of automaticity. As we shall show, the standard definitions which are equivalent in the case of words are not equivalent in the context of permutations. We investigate the relationships between these definitions and prove that...
On automatic infinite permutations∗
An infinite permutation α is a linear ordering of N. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this paper, we try to extend to permutations the notion of automaticity. As we shall show, the standard definitions which are equivalent in the case of words are not equivalent in the context of permutations. We investigate the relationships...
On automorphisms of digraphs without symmetric cycles
A digraph is a symmetric cycle if it is symmetric and its underlying graph is a cycle. It is proved that if is an asymmetric digraph not containing a symmetric cycle, then remains asymmetric after removing some vertex. It is also showed that each digraph without a symmetric cycle, whose underlying graph is connected, contains a vertex which is a common fixed point of all automorphisms of .