Graph theory question about vertices represented as multiple sets
up vote
0
down vote
favorite
I have a beginner Graph theory question. We just started learning it for my discrete math class and I'm confused about the wording of this question. In the examples done in class and in the textbook, the set of vertices is always represented as a single set of finite integers.
In this question however, it says the vertices are the sets {a,b}. Could someone clarify what exactly this means and the implications of this, as well as any hints for the question?
Thanks a lot
graph-theory
asked Nov 15 at 23:41
tkon
161
add a comment |
up vote
0
down vote
favorite
I have a beginner Graph theory question. We just started learning it for my discrete math class and I'm confused about the wording of this question. In the examples done in class and in the textbook, the set of vertices is always represented as a single set of finite integers.
In this question however, it says the vertices are the sets {a,b}. Could someone clarify what exactly this means and the implications of this, as well as any hints for the question?
Thanks a lot
graph-theory
asked Nov 15 at 23:41
tkon
161
Fix $n$ to be $5$, the minimum allowable value. Take pairs of distinct numbers from ${1,2,3,4,5}$, e.g. ${2,3}$. These are your vertices. How many of them can you find? Which ones are joined by edges? Duplicate the same experiment with different values of $n$.
– John Douma
Nov 15 at 23:47
Ohh right I see now, thanks for the clarification.
– tkon
Nov 15 at 23:59
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
I have a beginner Graph theory question. We just started learning it for my discrete math class and I'm confused about the wording of this question. In the examples done in class and in the textbook, the set of vertices is always represented as a single set of finite integers.
In this question however, it says the vertices are the sets {a,b}. Could someone clarify what exactly this means and the implications of this, as well as any hints for the question?
Thanks a lot
graph-theory
asked Nov 15 at 23:41
tkon
161
I have a beginner Graph theory question. We just started learning it for my discrete math class and I'm confused about the wording of this question. In the examples done in class and in the textbook, the set of vertices is always represented as a single set of finite integers.
In this question however, it says the vertices are the sets {a,b}. Could someone clarify what exactly this means and the implications of this, as well as any hints for the question?
Thanks a lot
graph-theory
graph-theory
asked Nov 15 at 23:41
tkon
161
asked Nov 15 at 23:41
tkon
161
asked Nov 15 at 23:41
tkon
161
asked Nov 15 at 23:41
tkon
161
asked Nov 15 at 23:41
tkon
161
161
Fix $n$ to be $5$, the minimum allowable value. Take pairs of distinct numbers from ${1,2,3,4,5}$, e.g. ${2,3}$. These are your vertices. How many of them can you find? Which ones are joined by edges? Duplicate the same experiment with different values of $n$.
– John Douma
Nov 15 at 23:47
Ohh right I see now, thanks for the clarification.
– tkon
Nov 15 at 23:59
add a comment |
Fix $n$ to be $5$, the minimum allowable value. Take pairs of distinct numbers from ${1,2,3,4,5}$, e.g. ${2,3}$. These are your vertices. How many of them can you find? Which ones are joined by edges? Duplicate the same experiment with different values of $n$.
– John Douma
Nov 15 at 23:47
Ohh right I see now, thanks for the clarification.
– tkon
Nov 15 at 23:59
Fix $n$ to be $5$, the minimum allowable value. Take pairs of distinct numbers from ${1,2,3,4,5}$, e.g. ${2,3}$. These are your vertices. How many of them can you find? Which ones are joined by edges? Duplicate the same experiment with different values of $n$.
– John Douma
Nov 15 at 23:47
Fix $n$ to be $5$, the minimum allowable value. Take pairs of distinct numbers from ${1,2,3,4,5}$, e.g. ${2,3}$. These are your vertices. How many of them can you find? Which ones are joined by edges? Duplicate the same experiment with different values of $n$.
– John Douma
Nov 15 at 23:47
Ohh right I see now, thanks for the clarification.
– tkon
Nov 15 at 23:59
Ohh right I see now, thanks for the clarification.
– tkon
Nov 15 at 23:59
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics 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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2fmath.stackexchange.com%2fquestions%2f3000503%2fgraph-theory-question-about-vertices-represented-as-multiple-sets%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
Fix $n$ to be $5$, the minimum allowable value. Take pairs of distinct numbers from ${1,2,3,4,5}$, e.g. ${2,3}$. These are your vertices. How many of them can you find? Which ones are joined by edges? Duplicate the same experiment with different values of $n$.
– John Douma
Nov 15 at 23:47
Ohh right I see now, thanks for the clarification.
– tkon
Nov 15 at 23:59