The average distance and the independence number. On unavoidable hypergraphs. On the addressing problem for directed graphs. Extremal subgraphs for two graphs. On the cutwidth and the topological bandwidth of a tree.
Diameter bounds for altered graphs.
Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs. Edge-colored complete graphs with precisely colored subgraphs. On optimal linear arrangements of trees. On unavoidable graphs. On universal graphs for spanning trees.