MHB What Is the Minimum Number of Meeting Times Needed for Overlapping Committees?

  • Thread starter Thread starter johndunlop
  • Start date Start date
Click For Summary
To ensure that no committee member is scheduled for overlapping meetings, the computer science department needs to determine the minimum number of distinct meeting times required for six committees. Each committee has varying members, leading to potential conflicts in scheduling. The discussion emphasizes the importance of identifying these overlaps to avoid double-booking. Participants are encouraged to share their progress or initial thoughts to facilitate effective assistance. A clear understanding of the member overlaps is crucial for finding a solution.
johndunlop
Messages
1
Reaction score
0
The computer science department has 6 committees that meet once a month. How many different meeting times (in a month) must be used to guarantee that no one is scheduled to be at 2 meetings at the same time, if committees and their members are given below.

C1 = {Daim, Viknesh, Lila}, C2 = {Viknesh, Johanes, Philo}, C3 = {Daim, Lila, Philo},
C4 = {Johanes, Lila, Philo}, C5 = {Daim, Lila}, C6 = {Viknesh, Daim, Philo}
 
Physics news on Phys.org
Hello johndunlop and welcome to MHB! :D

We ask that our users show their progress (work thus far or thoughts on how to begin) when posting questions. This way our helpers can see where you are stuck or may be going astray and will be able to post the best help possible without potentially making a suggestion which you have already tried, which would waste your time and that of the helper.

Can you post what you have done so far?
 

Thread 'Hypothesis testing: Defining H0, HA hypotheses so that ( H_A)_A' makes sense'

The standard _A " operator" maps a Null Hypothesis Ho into a decision set { Do not reject:=1 and reject :=0}. In this sense ( HA)_A , makes no sense. Since H0, HA aren't exhaustive, can we find an alternative operator, _A' , so that ( H_A)_A' makes sense? Isn't Pearson Neyman related to this? Hope I'm making sense. Edit: I was motivated by a superficial similarity of the idea with double transposition of matrices M, with ## (M^{T})^{T}=M##, and just wanted to see if it made sense to talk...
View full post »

Similar threads

MHB What Is the Probability of Receiving Identical Pairs from Random Crates?
  • · Replies 1 ·
Replies
1
Views
2K
Data structure and algorithms time computation?
  • · Replies 2 ·
Replies
2
Views
1K
Solve an Algebraic Equation: A+B=C
  • · Replies 2 ·
Replies
2
Views
2K
GAMESS computing and quantum chemistry
  • · Replies 2 ·
Replies
2
Views
5K
Meet jtbell: Meet a Mentor Series Interview
  • · Replies 12 ·
Replies
12
Views
6K
Kalman Filter for State Estimation
  • · Replies 1 ·
Replies
1
Views
3K
BRS: Subgroup lattice of a Permutation Group via GAP
  • · Replies 1 ·
Replies
1
Views
3K
Programs Need Opinions On Majors/Minors (Update from last year's post)
  • · Replies 1 ·
Replies
1
Views
3K
A very complicated puzzle: the planet of lies
  • · Replies 2 ·
Replies
2
Views
4K
Schools Truly Needing Academic Guidance to Prep for Grad School
  • · Replies 2 ·
Replies
2
Views
3K