My Graph Theory Students
$begingroup$
I have 18 students in my graph theory course this semester: Anne, Bernard, Clare, David,..., and Rachel. At the start of the course I asked them to draw the graph below, in which each of them is represented by a vertex, two of which are joined by a line if, and only if, they represent two students who are friends.
Fewer than half my students turned up for class last Friday. However, because each of the absent students happened to be friends with at least one of those who did attend, I was able to return everyone's assignments either personally or through a friend. In fact, had a smaller group of students shown up for my class on Friday, I would have been unable to do this.
How may students attended my class on Friday, and who were they?
mathematics no-computers graph-theory
asked Mar 15 at 14:43
Bernardo Recamán SantosBernardo Recamán Santos
2,7561349
$endgroup$
add a comment |
$begingroup$
I have 18 students in my graph theory course this semester: Anne, Bernard, Clare, David,..., and Rachel. At the start of the course I asked them to draw the graph below, in which each of them is represented by a vertex, two of which are joined by a line if, and only if, they represent two students who are friends.
Fewer than half my students turned up for class last Friday. However, because each of the absent students happened to be friends with at least one of those who did attend, I was able to return everyone's assignments either personally or through a friend. In fact, had a smaller group of students shown up for my class on Friday, I would have been unable to do this.
How may students attended my class on Friday, and who were they?
mathematics no-computers graph-theory
asked Mar 15 at 14:43
Bernardo Recamán SantosBernardo Recamán Santos
2,7561349
$endgroup$
add a comment |
$begingroup$
I have 18 students in my graph theory course this semester: Anne, Bernard, Clare, David,..., and Rachel. At the start of the course I asked them to draw the graph below, in which each of them is represented by a vertex, two of which are joined by a line if, and only if, they represent two students who are friends.
Fewer than half my students turned up for class last Friday. However, because each of the absent students happened to be friends with at least one of those who did attend, I was able to return everyone's assignments either personally or through a friend. In fact, had a smaller group of students shown up for my class on Friday, I would have been unable to do this.
How may students attended my class on Friday, and who were they?
mathematics no-computers graph-theory
asked Mar 15 at 14:43
Bernardo Recamán SantosBernardo Recamán Santos
2,7561349
$endgroup$
I have 18 students in my graph theory course this semester: Anne, Bernard, Clare, David,..., and Rachel. At the start of the course I asked them to draw the graph below, in which each of them is represented by a vertex, two of which are joined by a line if, and only if, they represent two students who are friends.
Fewer than half my students turned up for class last Friday. However, because each of the absent students happened to be friends with at least one of those who did attend, I was able to return everyone's assignments either personally or through a friend. In fact, had a smaller group of students shown up for my class on Friday, I would have been unable to do this.
How may students attended my class on Friday, and who were they?
mathematics no-computers graph-theory
mathematics no-computers graph-theory
asked Mar 15 at 14:43
Bernardo Recamán SantosBernardo Recamán Santos
2,7561349
asked Mar 15 at 14:43
Bernardo Recamán SantosBernardo Recamán Santos
2,7561349
asked Mar 15 at 14:43
Bernardo Recamán SantosBernardo Recamán Santos
2,7561349
asked Mar 15 at 14:43
Bernardo Recamán SantosBernardo Recamán Santos
2,7561349
asked Mar 15 at 14:43
Bernardo Recamán SantosBernardo Recamán Santos
2,7561349
2,7561349
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
This is an excellent question to demonstrate why the greedy algorithm doesn't always work
The minimum number is actually
$4$
Here are the students which would satisfy the criteria (I think this group is unique)
$F, J, N, O$ (Frank, Jack, Norman, Orville)
Proof that this is minimal
As El-Guest pointed out the maximum number of friendships in the group are held by $M$ & $E$ with $6$ & $5$, respectively. Every other person has four friends or fewer. Therefore, the maximum possible number of people covered by three students is $7+6+5 = 18$. This could only possibly be achieved if $M$ and $E$ were in the group of three but, as El-Guest explored, you need to add three more students to cover everyone else.
answered Mar 15 at 15:45
hexominohexomino
44k3132212
$endgroup$
$begingroup$
I used a solver, getting the same solution and only this one ; hence i am pretty sure it is unique.
$endgroup$
– aluriak
Mar 15 at 18:26
1
$begingroup$
For those interested in the mathematical details, this is called the Set Cover problem. It is a well known problem in computer science and is NP-Hard.The best known linear programming approaches take exponential time.
$endgroup$
– darksky
Mar 16 at 17:49
add a comment |
$begingroup$
I'd assume that you'd want
to have the students attend which have the maximum number of friendships...
So:
M & E have 6 & 5 friendships respectively, then P,Q,R,D,F,J don't have to go thanks to M; and A,H,K,N,R don't have to go thanks to E. This leaves us with B,C,G,I,L,O who we need to deal with. O is only connected to P,Q,R, so they have to attend; C is connected with G,I,L; and then B is the last one left who has to show up.
The minimum number of students is therefore
5, and they are Megan, Ethan, Billy, Chris, and Orville.
answered Mar 15 at 14:52
El-GuestEl-Guest
20.8k24690
$endgroup$
$begingroup$
I figured as much, I didn't like how two of the students had to double up.
$endgroup$
– El-Guest
Mar 15 at 15:00
3
$begingroup$
How do you know this is minimal?
$endgroup$
– noedne
Mar 15 at 15:23
1
$begingroup$
I didn’t, as clearly demonstrated by hexomino’s answer.
$endgroup$
– El-Guest
Mar 15 at 15:52
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "559"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f80718%2fmy-graph-theory-students%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
This is an excellent question to demonstrate why the greedy algorithm doesn't always work
The minimum number is actually
$4$
Here are the students which would satisfy the criteria (I think this group is unique)
$F, J, N, O$ (Frank, Jack, Norman, Orville)
Proof that this is minimal
As El-Guest pointed out the maximum number of friendships in the group are held by $M$ & $E$ with $6$ & $5$, respectively. Every other person has four friends or fewer. Therefore, the maximum possible number of people covered by three students is $7+6+5 = 18$. This could only possibly be achieved if $M$ and $E$ were in the group of three but, as El-Guest explored, you need to add three more students to cover everyone else.
answered Mar 15 at 15:45
hexominohexomino
44k3132212
$endgroup$
$begingroup$
I used a solver, getting the same solution and only this one ; hence i am pretty sure it is unique.
$endgroup$
– aluriak
Mar 15 at 18:26
1
$begingroup$
For those interested in the mathematical details, this is called the Set Cover problem. It is a well known problem in computer science and is NP-Hard.The best known linear programming approaches take exponential time.
$endgroup$
– darksky
Mar 16 at 17:49
add a comment |
$begingroup$
This is an excellent question to demonstrate why the greedy algorithm doesn't always work
The minimum number is actually
$4$
Here are the students which would satisfy the criteria (I think this group is unique)
$F, J, N, O$ (Frank, Jack, Norman, Orville)
Proof that this is minimal
As El-Guest pointed out the maximum number of friendships in the group are held by $M$ & $E$ with $6$ & $5$, respectively. Every other person has four friends or fewer. Therefore, the maximum possible number of people covered by three students is $7+6+5 = 18$. This could only possibly be achieved if $M$ and $E$ were in the group of three but, as El-Guest explored, you need to add three more students to cover everyone else.
answered Mar 15 at 15:45
hexominohexomino
44k3132212
$endgroup$
$begingroup$
I used a solver, getting the same solution and only this one ; hence i am pretty sure it is unique.
$endgroup$
– aluriak
Mar 15 at 18:26
1
$begingroup$
For those interested in the mathematical details, this is called the Set Cover problem. It is a well known problem in computer science and is NP-Hard.The best known linear programming approaches take exponential time.
$endgroup$
– darksky
Mar 16 at 17:49
add a comment |
$begingroup$
This is an excellent question to demonstrate why the greedy algorithm doesn't always work
The minimum number is actually
$4$
Here are the students which would satisfy the criteria (I think this group is unique)
$F, J, N, O$ (Frank, Jack, Norman, Orville)
Proof that this is minimal
As El-Guest pointed out the maximum number of friendships in the group are held by $M$ & $E$ with $6$ & $5$, respectively. Every other person has four friends or fewer. Therefore, the maximum possible number of people covered by three students is $7+6+5 = 18$. This could only possibly be achieved if $M$ and $E$ were in the group of three but, as El-Guest explored, you need to add three more students to cover everyone else.
answered Mar 15 at 15:45
hexominohexomino
44k3132212
$endgroup$
This is an excellent question to demonstrate why the greedy algorithm doesn't always work
The minimum number is actually
$4$
Here are the students which would satisfy the criteria (I think this group is unique)
$F, J, N, O$ (Frank, Jack, Norman, Orville)
Proof that this is minimal
As El-Guest pointed out the maximum number of friendships in the group are held by $M$ & $E$ with $6$ & $5$, respectively. Every other person has four friends or fewer. Therefore, the maximum possible number of people covered by three students is $7+6+5 = 18$. This could only possibly be achieved if $M$ and $E$ were in the group of three but, as El-Guest explored, you need to add three more students to cover everyone else.
answered Mar 15 at 15:45
hexominohexomino
44k3132212
edited Mar 15 at 15:50
answered Mar 15 at 15:45
hexominohexomino
44k3132212
answered Mar 15 at 15:45
hexominohexomino
44k3132212
answered Mar 15 at 15:45
hexominohexomino
44k3132212
44k3132212
$begingroup$
I used a solver, getting the same solution and only this one ; hence i am pretty sure it is unique.
$endgroup$
– aluriak
Mar 15 at 18:26
1
$begingroup$
For those interested in the mathematical details, this is called the Set Cover problem. It is a well known problem in computer science and is NP-Hard.The best known linear programming approaches take exponential time.
$endgroup$
– darksky
Mar 16 at 17:49
add a comment |
$begingroup$
I used a solver, getting the same solution and only this one ; hence i am pretty sure it is unique.
$endgroup$
– aluriak
Mar 15 at 18:26
1
$begingroup$
For those interested in the mathematical details, this is called the Set Cover problem. It is a well known problem in computer science and is NP-Hard.The best known linear programming approaches take exponential time.
$endgroup$
– darksky
Mar 16 at 17:49
$begingroup$
I used a solver, getting the same solution and only this one ; hence i am pretty sure it is unique.
$endgroup$
– aluriak
Mar 15 at 18:26
$begingroup$
I used a solver, getting the same solution and only this one ; hence i am pretty sure it is unique.
$endgroup$
– aluriak
Mar 15 at 18:26
1
1
$begingroup$
For those interested in the mathematical details, this is called the Set Cover problem. It is a well known problem in computer science and is NP-Hard.The best known linear programming approaches take exponential time.
$endgroup$
– darksky
Mar 16 at 17:49
$begingroup$
For those interested in the mathematical details, this is called the Set Cover problem. It is a well known problem in computer science and is NP-Hard.The best known linear programming approaches take exponential time.
$endgroup$
– darksky
Mar 16 at 17:49
add a comment |
$begingroup$
I'd assume that you'd want
to have the students attend which have the maximum number of friendships...
So:
M & E have 6 & 5 friendships respectively, then P,Q,R,D,F,J don't have to go thanks to M; and A,H,K,N,R don't have to go thanks to E. This leaves us with B,C,G,I,L,O who we need to deal with. O is only connected to P,Q,R, so they have to attend; C is connected with G,I,L; and then B is the last one left who has to show up.
The minimum number of students is therefore
5, and they are Megan, Ethan, Billy, Chris, and Orville.
answered Mar 15 at 14:52
El-GuestEl-Guest
20.8k24690
$endgroup$
$begingroup$
I figured as much, I didn't like how two of the students had to double up.
$endgroup$
– El-Guest
Mar 15 at 15:00
3
$begingroup$
How do you know this is minimal?
$endgroup$
– noedne
Mar 15 at 15:23
1
$begingroup$
I didn’t, as clearly demonstrated by hexomino’s answer.
$endgroup$
– El-Guest
Mar 15 at 15:52
add a comment |
$begingroup$
I'd assume that you'd want
to have the students attend which have the maximum number of friendships...
So:
M & E have 6 & 5 friendships respectively, then P,Q,R,D,F,J don't have to go thanks to M; and A,H,K,N,R don't have to go thanks to E. This leaves us with B,C,G,I,L,O who we need to deal with. O is only connected to P,Q,R, so they have to attend; C is connected with G,I,L; and then B is the last one left who has to show up.
The minimum number of students is therefore
5, and they are Megan, Ethan, Billy, Chris, and Orville.
answered Mar 15 at 14:52
El-GuestEl-Guest
20.8k24690
$endgroup$
$begingroup$
I figured as much, I didn't like how two of the students had to double up.
$endgroup$
– El-Guest
Mar 15 at 15:00
3
$begingroup$
How do you know this is minimal?
$endgroup$
– noedne
Mar 15 at 15:23
1
$begingroup$
I didn’t, as clearly demonstrated by hexomino’s answer.
$endgroup$
– El-Guest
Mar 15 at 15:52
add a comment |
$begingroup$
I'd assume that you'd want
to have the students attend which have the maximum number of friendships...
So:
M & E have 6 & 5 friendships respectively, then P,Q,R,D,F,J don't have to go thanks to M; and A,H,K,N,R don't have to go thanks to E. This leaves us with B,C,G,I,L,O who we need to deal with. O is only connected to P,Q,R, so they have to attend; C is connected with G,I,L; and then B is the last one left who has to show up.
The minimum number of students is therefore
5, and they are Megan, Ethan, Billy, Chris, and Orville.
answered Mar 15 at 14:52
El-GuestEl-Guest
20.8k24690
$endgroup$
I'd assume that you'd want
to have the students attend which have the maximum number of friendships...
So:
M & E have 6 & 5 friendships respectively, then P,Q,R,D,F,J don't have to go thanks to M; and A,H,K,N,R don't have to go thanks to E. This leaves us with B,C,G,I,L,O who we need to deal with. O is only connected to P,Q,R, so they have to attend; C is connected with G,I,L; and then B is the last one left who has to show up.
The minimum number of students is therefore
5, and they are Megan, Ethan, Billy, Chris, and Orville.
answered Mar 15 at 14:52
El-GuestEl-Guest
20.8k24690
answered Mar 15 at 14:52
El-GuestEl-Guest
20.8k24690
answered Mar 15 at 14:52
El-GuestEl-Guest
20.8k24690
answered Mar 15 at 14:52
El-GuestEl-Guest
20.8k24690
20.8k24690
$begingroup$
I figured as much, I didn't like how two of the students had to double up.
$endgroup$
– El-Guest
Mar 15 at 15:00
3
$begingroup$
How do you know this is minimal?
$endgroup$
– noedne
Mar 15 at 15:23
1
$begingroup$
I didn’t, as clearly demonstrated by hexomino’s answer.
$endgroup$
– El-Guest
Mar 15 at 15:52
add a comment |
$begingroup$
I figured as much, I didn't like how two of the students had to double up.
$endgroup$
– El-Guest
Mar 15 at 15:00
3
$begingroup$
How do you know this is minimal?
$endgroup$
– noedne
Mar 15 at 15:23
1
$begingroup$
I didn’t, as clearly demonstrated by hexomino’s answer.
$endgroup$
– El-Guest
Mar 15 at 15:52
$begingroup$
I figured as much, I didn't like how two of the students had to double up.
$endgroup$
– El-Guest
Mar 15 at 15:00
$begingroup$
I figured as much, I didn't like how two of the students had to double up.
$endgroup$
– El-Guest
Mar 15 at 15:00
3
3
$begingroup$
How do you know this is minimal?
$endgroup$
– noedne
Mar 15 at 15:23
$begingroup$
How do you know this is minimal?
$endgroup$
– noedne
Mar 15 at 15:23
1
1
$begingroup$
I didn’t, as clearly demonstrated by hexomino’s answer.
$endgroup$
– El-Guest
Mar 15 at 15:52
$begingroup$
I didn’t, as clearly demonstrated by hexomino’s answer.
$endgroup$
– El-Guest
Mar 15 at 15:52
add a comment |
Thanks for contributing an answer to Puzzling Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f80718%2fmy-graph-theory-students%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
