6533b833fe1ef96bd129c031
RESEARCH PRODUCT
Graph Connectivity, Monadic NP and built-in relations of moderate degree
Thomas Schwenticksubject
Discrete mathematicsVoltage graphlaw.inventionCombinatoricsMathematics::LogiclawComputer Science::Logic in Computer ScienceClique-widthLine graphRegular graphGraph automorphismNull graphComputer Science::Formal Languages and Automata TheoryConnectivityComplement graphMathematicsdescription
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.
year | journal | country | edition | language |
---|---|---|---|---|
1995-01-01 |