The Erdős–Pósa property forms a pivotal concept in modern graph theory by establishing a profound duality between the problems of packing and covering cycles or other substructures. At its core, this ...

Commuting graphs have emerged as a powerful framework for elucidating complex relationships within finite group theory. In these graphs, vertices typically represent non-central elements of a group, ...

We consider a special version of random sequential adsorption (RSA) with nearest-neighbor interaction on infinite tree graphs. In classical RSA, starting with a graph with initially inactive nodes, ...