On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs. The number of cycle lengths in graphs of given minimum degree and girth. Vertex colorings with a distance restriction. A communication problem and directed triple systems. A remark on the number of complete and empty subgraphs.
Monochromatic path covers in nearly complete graphs.
A class of edge critical 4-chromatic graphs. Local and mean k -Ramsey numbers for complete graphs. Special monochromatic trees in two-colored complete graphs. A new game chromatic number. European J. Combin.