The Complexity of the Fixed Clique Property
Journal of Graph Algorithms and Applications, Tome 28 (2024) no. 1, pp. 351-363.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

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.
DOI : 10.7155/jgaa.v28i1.2957
Keywords: complexity, fixed clique property, fixed simplex property

Bernd Schröder 1

1 School of Mathematics and Natural Sciences, The University of Southern Mississippi
@article{JGAA_2024_28_1_a13,
     author = {Bernd Schr\"oder},
     title = {The {Complexity} of the {Fixed} {Clique} {Property}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {351--363},
     publisher = {mathdoc},
     volume = {28},
     number = {1},
     year = {2024},
     doi = {10.7155/jgaa.v28i1.2957},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.v28i1.2957/}
}
TY  - JOUR
AU  - Bernd Schröder
TI  - The Complexity of the Fixed Clique Property
JO  - Journal of Graph Algorithms and Applications
PY  - 2024
SP  - 351
EP  - 363
VL  - 28
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.v28i1.2957/
DO  - 10.7155/jgaa.v28i1.2957
LA  - en
ID  - JGAA_2024_28_1_a13
ER  - 
%0 Journal Article
%A Bernd Schröder
%T The Complexity of the Fixed Clique Property
%J Journal of Graph Algorithms and Applications
%D 2024
%P 351-363
%V 28
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.v28i1.2957/
%R 10.7155/jgaa.v28i1.2957
%G en
%F JGAA_2024_28_1_a13
Bernd Schröder. The Complexity of the Fixed Clique Property. Journal of Graph Algorithms and Applications, Tome 28 (2024) no. 1, pp. 351-363. doi : 10.7155/jgaa.v28i1.2957. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.v28i1.2957/

Cité par Sources :