6533b833fe1ef96bd129c031

RESEARCH PRODUCT

Graph Connectivity, Monadic NP and built-in relations of moderate degree

Thomas Schwentick

subject

Discrete mathematicsVoltage graphlaw.inventionCombinatoricsMathematics::LogiclawComputer Science::Logic in Computer ScienceClique-widthLine graphRegular graphGraph automorphismNull graphComputer Science::Formal Languages and Automata TheoryConnectivityComplement graphMathematics

description

It has been conjectured [FSV93] that an existential secondoder formula, in which the second-order quantification is restricted to unary relations (i.e. a Monadic NP formula), cannot express Graph Connectivity even in the presence of arbitrary built-in relations.

https://doi.org/10.1007/3-540-60084-1_92