One proves that certain numbers occurring in a problem of paths enumeration, studied by Niederhausen in [7] (see also [10]), are top intersection numbers in the cohomology ring of...
We show that the adjacency matrix M of the line digraph of a d-regular digraph D on n vertices can be written as M = AB, where the matrix A is the Kronecker product of the all-one...
The simple assembly line balancing problem is a classical integer programming problem in operations research. A set of tasks, each one being an indivisible amount of work requirin...
The purpose of this note is to demonstrate that a weak form of club guessing on 1 implies the existence of an Aronszajn line with no Countryman suborders. An immediate consequence ...
The binary codes of the line graphs Lm(n) of the complete multipartite graphs Kn1,...,nm (ni = n for 1 ≤ i ≤ m) n ≥ 2, m ≥ 3 are examined, and PD-sets and s-PD-sets are fo...