The Complexity of the Fixed Clique Property
Bernd S. W. Schröder · Journal of Graph Algorithms and Applications · 2024
We prove that the following decision problems are co-NP-complete:Determinewhether a finite reflexive graph has the fixed clique property.Determinewhether a finite simplicial complex has the fixed simplex property.Determinewhether a finite truncated lattice has the fixed point property.