Combinatorics and Graph Theory

    

Graph Thinness, a Lower Bound and Complexity

Authors: Yaroslav Shitov

The thinness of a simple graph G= (V,E) is the smallest integer k for which there exist a total order (V, <) and a partition of V into k classes (V_1,...,V_k) such that, for all u, v, w in V with u<v<w, if u and v belong to the same class and {u,w} is in E, then {v,w} is in E. We prove that (1) there are $n$-vertex graphs of thinness $n-o(n)$, which answers a question of Bonomo-Braberman, Gonzalez, Oliveira, Sampaio, and Szwarcfiter, (2) the computation of thinness is NP-hard, which is a solution to a long standing open problem posed by Mannino and Oriolo.

Comments: 9 pages

Download: PDF

Submission history

[v1] 2021-12-30 18:20:18

Unique-IP document downloads: 400 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus