Erdős-Ko-Rado theorems for uniform set-partition systems.
A Sperner-type theorem for set-partition systems.
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings
The zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper bound on the minimum number of induced paths in the graph that cover all the vertices of the graph, while the positive zero forcing number is an upper bound on the minimum number of induced trees in the graph needed to cover all the vertices in the graph. We show that for a block-cycle graph the zero forcing number equals...
Page 1