Current location - Training Enrollment Network - Mathematics courses - Solving Euler path by discrete mathematics
Solving Euler path by discrete mathematics
Because of the different versions, I don't know some of them.

1.( 1)a∈X, b∈X and aRb=bRa(3) acyclic (8)2(9) Euler path (11) p ∨ q (/)

(1) (VX) (x ∈ a → x ∈ b) (4) (VX) (x ∈ a → < x, x & gt∈R) others are written by themselves.

Third, (1)R? S = { = { & ltx,y & gt,& lty,z & gt,& ltz,z & gt,& ltx,z & gt,& lty,y & gt,& ltz,y & gt}(3)A×A = = { & lt; 1, 1 & gt; ,& lt 1,2 & gt; ,& lt 1,{ 2 } & gt,& lt2, 1 & gt; ,& lt2,2 & gt; ,& lt2,{ 2 } & gt,& lt{2}, 1 & gt; ,& lt{2},2 & gt,& lt{2}、{ 2 } & gt}

( 1) (A-B)-C

= (A-B) ∩ ~C

= (A∩~B) ∩ ~C

= A∩(~B ∩ ~C)

= A∩(~ B∩~ C)∩(C∩~ C)

= A∩(~C ∩(~B ∪C))

= (A∩~C) ∩(~B ∪C)

= (A∩~C) ∩~(B ∩~ C)

= (A-C)∩~(B-C)

= (A-C)-(B-C)