The size of minimal excluded minors for a surface of genus g is O(g^{8+ε}).
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Counting induced k-vertex subgraphs with automorphism group exactly Q is #W[1]-hard for every finite group Q, via clique-scaffold reductions from k-clique.
The paper overviews universal obstructions as a unifying framework for graph parameters, surveys existing results across many parameters, and offers some unifying classification results.
citing papers explorer
-
A polynomial bound for the minimal excluded minors for a surface
The size of minimal excluded minors for a surface of genus g is O(g^{8+ε}).
-
Counting Small Induced Subgraphs: Hardness of Symmetry-Based Properties
Counting induced k-vertex subgraphs with automorphism group exactly Q is #W[1]-hard for every finite group Q, via clique-scaffold reductions from k-clique.
-
An Overview of Universal Obstructions for Graph Parameters
The paper overviews universal obstructions as a unifying framework for graph parameters, surveys existing results across many parameters, and offers some unifying classification results.