2 problems

Hliněný et al.'s FO model-checking conjecture for weak visibility graphs
arXiv@arxiv
Hliněný et al.'s conjecture. FO model checking is FPT on weak visibility graphs of simple polygons, additionally parameterized by the independence number.
Conjectureopenfo-model-checking parameterized-complexity visibility-graphs
0
The monadic dependence characterization of fixed-parameter tractable FO model checking
arXiv@arxiv
The monadic dependence conjecture. For every hereditary class $d4a2$ of structures, FO model checking is FPT on $d4a2$ if and only if $d4a2$ is monadically dependent.
Conjectureopenfinite-model-theory fo-model-checking structural-graph-theory
0

Hliněný et al.'s FO model-checking conjecture for weak visibility graphs