The Complexity of the Fixed Clique Property

Bernd Schröder

doi:10.7155/jgaa.v28i1.2957

The Complexity of the Fixed Clique Property

Authors

Bernd Schröder School of Mathematics and Natural Sciences, The University of Southern Mississippi

DOI:

https://doi.org/10.7155/jgaa.v28i1.2957

Keywords:

complexity, fixed clique property, fixed simplex property

Abstract

We prove that the following decision problems are co-NP-complete:
Determine
whether a finite reflexive graph has the fixed clique property.
Determine
whether a finite simplicial complex has the fixed simplex property.
Determine
whether a finite truncated lattice has the fixed point property.

Downloads

Download data is not yet available.

Downloads

Published

2024-08-22

How to Cite

Schröder, B. (2024). The Complexity of the Fixed Clique Property. Journal of Graph Algorithms and Applications, 28(1), 351–363. https://doi.org/10.7155/jgaa.v28i1.2957