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.
No takes yet. Share an insight, caveat, or question.
Bernd S. W. Schröder (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: