Count on CFI graphs for #P-hardness

Keyphrases

• Homomorphism 100%
• Linear Combination 100%
• CI-graph 100%
• #P-hardness 100%
• Polynomial Time 40%
• Pattern Graph 40%
• Induced Subgraph 40%
• Graph Parameters 40%
• Fixed Pattern 40%
• Computational Complexity 20%
• General Graphs 20%
• Novel Technique 20%
• Maximum Degree 20%
• Parameterized Complexity 20%
• Graph Classes 20%
• Oracle 20%
• Result-oriented 20%
• Subgraph Counting 20%
• Interpreting Graphs 20%
• Vertex Coloring 20%
• Treewidth 20%
• Maximum Size 20%
• Polynomial-time Reduction 20%
• Graph Products 20%
• V(V) 20%
• Size of Graph 20%

Mathematics

• Homomorphism 100%
• Linear Combination 80%
• Polynomial Time 60%
• Induced Subgraph 40%
• Edge 20%
• Maximum Degree 20%

Computer Science

• Linear Combination 100%
• Polynomial Time 60%
• Subgraphs 40%
• Computational Complexity 20%