On the variety of general position problems under vertex and edge removal
Combinatorics
2026-02-04 v2
Abstract
Let , , and be the total, the outer, and the dual general position number of a graph , respectively. This paper investigates how removing a vertex or removing an edge affects these graph invariants. It is proved that if is not a cut vertex, then . On the other hand, and can be respectively arbitrarily larger/smaller than and . On the positive side, it is proved that if lies in some -set, then , and that if is not a cut vertex and lies in some -set of , then . For the edge removal, it is proved that (i) , where is the set of simplicial vertices adjacent to both endvertices of , (ii) , and (iii) that can be arbitrarily large. All bounds are demonstrated to be sharp.
Cite
@article{arxiv.2510.01294,
title = {On the variety of general position problems under vertex and edge removal},
author = {Jing Tian and Pakanun Dokyeesun and Sandi Klavžar},
journal= {arXiv preprint arXiv:2510.01294},
year = {2026}
}