1. There is a gathering in 50 people, some greet each other, some do not. a.Represent this scenario in terms of a graph
Posted: Tue Apr 26, 2022 5:37 pm
1. There is a gathering in 50 people, some greet each other,
some do not.
a.Represent this scenario in terms of a graph model and include
two sentences about how a problem can be solved with graph
theory.
b. prove at least two people greet the same number of people
2. a. prove for arbitrary sets A, B, C : (A \ B) \ C = A \
(B∪C)
b. prove for arbitrary sets A, B_1, B_2, ..., B_n : A \ (Union
(between i=1 and n) B_i = intersection (between i=1 and
n) (A\ B_i)
c. if A∪C = B∪C && A∩C = B∩C prove
that A=B
some do not.
a.Represent this scenario in terms of a graph model and include
two sentences about how a problem can be solved with graph
theory.
b. prove at least two people greet the same number of people
2. a. prove for arbitrary sets A, B, C : (A \ B) \ C = A \
(B∪C)
b. prove for arbitrary sets A, B_1, B_2, ..., B_n : A \ (Union
(between i=1 and n) B_i = intersection (between i=1 and
n) (A\ B_i)
c. if A∪C = B∪C && A∩C = B∩C prove
that A=B