Mixing
![Are 'belie' and 'hide' interchangable? [closed]](https://lh3.googleusercontent.com/-IjAIoeEvvCw/AAAAAAAAAAI/AAAAAAAAACE/2pOHVXummGc/s72-c/photo.jpg?sz=32)
Does the Graceful tree conjecture refer to all or only some trees?
$begingroup$
I am a total beginner in this field and i‘m not really versed in the terminology, so please bare with me.
What I know, is that a graceful labeling, refers to a tree with $n$ vertices, where each vertex is assigned a value that is smaller than the number of edges, and that are connected by an edge that has the value of the difference between the two vertices, and where all edges have a distinct value.
(Did I miss something?)
Now, you can separate trees into different classes, like: path, cycle, web, wheel, helm, gear, rectangular, $n$-dimensional hypercube, caterpillar, and lobster (with perfect matching) graphs, which are all proven to be graceful.
(Did I miss any?)
Are there any special classes/types of graphs that couldn't be proven until now?
And does the Ringel-Kotzig-Conjecture refer to any kind of tree (trees with loops and without, for example), or only to a specific class/classes?
graph-theory trees conjectures open-problem
edited Feb 21 at 15:19
Javi
3,0212832
asked Jan 27 at 13:28
LexythLexyth
62
$endgroup$
|
show 2 more comments
$begingroup$
I am a total beginner in this field and i‘m not really versed in the terminology, so please bare with me.
What I know, is that a graceful labeling, refers to a tree with $n$ vertices, where each vertex is assigned a value that is smaller than the number of edges, and that are connected by an edge that has the value of the difference between the two vertices, and where all edges have a distinct value.
(Did I miss something?)
Now, you can separate trees into different classes, like: path, cycle, web, wheel, helm, gear, rectangular, $n$-dimensional hypercube, caterpillar, and lobster (with perfect matching) graphs, which are all proven to be graceful.
(Did I miss any?)
Are there any special classes/types of graphs that couldn't be proven until now?
And does the Ringel-Kotzig-Conjecture refer to any kind of tree (trees with loops and without, for example), or only to a specific class/classes?
graph-theory trees conjectures open-problem
edited Feb 21 at 15:19
Javi
3,0212832
asked Jan 27 at 13:28
LexythLexyth
62
$endgroup$
$begingroup$
Are you refering to youtube.com/watch?v=v5KWzOOhZrw&app=desktop ?
$endgroup$
– Roddy MacPhee
Feb 21 at 14:09
$begingroup$
That’s where i first heard about it :D but i don‘t think i‘m refering to the video per se^^
$endgroup$
– Lexyth
Feb 21 at 14:13
$begingroup$
The show in the video that a cycle path alone can't work.
$endgroup$
– Roddy MacPhee
Feb 21 at 14:21
$begingroup$
Uhm... yes it can. If you do 0,1,3 then the differences will be 1,2,3, so it works. Btw, they don‘t say it in the video, but you can number the labels with <=n where n is the number of joints. So for 3 joints it’s 0-3
$endgroup$
– Lexyth
Feb 21 at 14:25
$begingroup$
en.m.wikipedia.org/wiki/Tree_(graph_theory) cycles are no longer trees.
$endgroup$
– Roddy MacPhee
Feb 21 at 14:41
|
show 2 more comments
$begingroup$
I am a total beginner in this field and i‘m not really versed in the terminology, so please bare with me.
What I know, is that a graceful labeling, refers to a tree with $n$ vertices, where each vertex is assigned a value that is smaller than the number of edges, and that are connected by an edge that has the value of the difference between the two vertices, and where all edges have a distinct value.
(Did I miss something?)
Now, you can separate trees into different classes, like: path, cycle, web, wheel, helm, gear, rectangular, $n$-dimensional hypercube, caterpillar, and lobster (with perfect matching) graphs, which are all proven to be graceful.
(Did I miss any?)
Are there any special classes/types of graphs that couldn't be proven until now?
And does the Ringel-Kotzig-Conjecture refer to any kind of tree (trees with loops and without, for example), or only to a specific class/classes?
graph-theory trees conjectures open-problem
edited Feb 21 at 15:19
Javi
3,0212832
asked Jan 27 at 13:28
LexythLexyth
62
$endgroup$
I am a total beginner in this field and i‘m not really versed in the terminology, so please bare with me.
What I know, is that a graceful labeling, refers to a tree with $n$ vertices, where each vertex is assigned a value that is smaller than the number of edges, and that are connected by an edge that has the value of the difference between the two vertices, and where all edges have a distinct value.
(Did I miss something?)
Now, you can separate trees into different classes, like: path, cycle, web, wheel, helm, gear, rectangular, $n$-dimensional hypercube, caterpillar, and lobster (with perfect matching) graphs, which are all proven to be graceful.
(Did I miss any?)
Are there any special classes/types of graphs that couldn't be proven until now?
And does the Ringel-Kotzig-Conjecture refer to any kind of tree (trees with loops and without, for example), or only to a specific class/classes?
graph-theory trees conjectures open-problem
graph-theory trees conjectures open-problem
edited Feb 21 at 15:19
Javi
3,0212832
asked Jan 27 at 13:28
LexythLexyth
62
edited Feb 21 at 15:19
Javi
3,0212832
asked Jan 27 at 13:28
LexythLexyth
62
edited Feb 21 at 15:19
Javi
3,0212832
edited Feb 21 at 15:19
Javi
3,0212832
edited Feb 21 at 15:19
Javi
3,0212832
3,0212832
asked Jan 27 at 13:28
LexythLexyth
62
asked Jan 27 at 13:28
LexythLexyth
62
asked Jan 27 at 13:28
LexythLexyth
62
62
$begingroup$
Are you refering to youtube.com/watch?v=v5KWzOOhZrw&app=desktop ?
$endgroup$
– Roddy MacPhee
Feb 21 at 14:09
$begingroup$
That’s where i first heard about it :D but i don‘t think i‘m refering to the video per se^^
$endgroup$
– Lexyth
Feb 21 at 14:13
$begingroup$
The show in the video that a cycle path alone can't work.
$endgroup$
– Roddy MacPhee
Feb 21 at 14:21
$begingroup$
Uhm... yes it can. If you do 0,1,3 then the differences will be 1,2,3, so it works. Btw, they don‘t say it in the video, but you can number the labels with <=n where n is the number of joints. So for 3 joints it’s 0-3
$endgroup$
– Lexyth
Feb 21 at 14:25
$begingroup$
en.m.wikipedia.org/wiki/Tree_(graph_theory) cycles are no longer trees.
$endgroup$
– Roddy MacPhee
Feb 21 at 14:41
|
show 2 more comments
$begingroup$
Are you refering to youtube.com/watch?v=v5KWzOOhZrw&app=desktop ?
$endgroup$
– Roddy MacPhee
Feb 21 at 14:09
$begingroup$
That’s where i first heard about it :D but i don‘t think i‘m refering to the video per se^^
$endgroup$
– Lexyth
Feb 21 at 14:13
$begingroup$
The show in the video that a cycle path alone can't work.
$endgroup$
– Roddy MacPhee
Feb 21 at 14:21
$begingroup$
Uhm... yes it can. If you do 0,1,3 then the differences will be 1,2,3, so it works. Btw, they don‘t say it in the video, but you can number the labels with <=n where n is the number of joints. So for 3 joints it’s 0-3
$endgroup$
– Lexyth
Feb 21 at 14:25
$begingroup$
en.m.wikipedia.org/wiki/Tree_(graph_theory) cycles are no longer trees.
$endgroup$
– Roddy MacPhee
Feb 21 at 14:41
$begingroup$
Are you refering to youtube.com/watch?v=v5KWzOOhZrw&app=desktop ?
$endgroup$
– Roddy MacPhee
Feb 21 at 14:09
$begingroup$
Are you refering to youtube.com/watch?v=v5KWzOOhZrw&app=desktop ?
$endgroup$
– Roddy MacPhee
Feb 21 at 14:09
$begingroup$
That’s where i first heard about it :D but i don‘t think i‘m refering to the video per se^^
$endgroup$
– Lexyth
Feb 21 at 14:13
$begingroup$
That’s where i first heard about it :D but i don‘t think i‘m refering to the video per se^^
$endgroup$
– Lexyth
Feb 21 at 14:13
$begingroup$
The show in the video that a cycle path alone can't work.
$endgroup$
– Roddy MacPhee
Feb 21 at 14:21
$begingroup$
The show in the video that a cycle path alone can't work.
$endgroup$
– Roddy MacPhee
Feb 21 at 14:21
$begingroup$
Uhm... yes it can. If you do 0,1,3 then the differences will be 1,2,3, so it works. Btw, they don‘t say it in the video, but you can number the labels with <=n where n is the number of joints. So for 3 joints it’s 0-3
$endgroup$
– Lexyth
Feb 21 at 14:25
$begingroup$
Uhm... yes it can. If you do 0,1,3 then the differences will be 1,2,3, so it works. Btw, they don‘t say it in the video, but you can number the labels with <=n where n is the number of joints. So for 3 joints it’s 0-3
$endgroup$
– Lexyth
Feb 21 at 14:25
$begingroup$
en.m.wikipedia.org/wiki/Tree_(graph_theory) cycles are no longer trees.
$endgroup$
– Roddy MacPhee
Feb 21 at 14:41
$begingroup$
en.m.wikipedia.org/wiki/Tree_(graph_theory) cycles are no longer trees.
$endgroup$
– Roddy MacPhee
Feb 21 at 14:41
|
show 2 more comments
0
active
oldest
votes
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: "69"
};
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: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
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%2fmath.stackexchange.com%2fquestions%2f3089560%2fdoes-the-graceful-tree-conjecture-refer-to-all-or-only-some-trees%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
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.
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%2f3089560%2fdoes-the-graceful-tree-conjecture-refer-to-all-or-only-some-trees%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
$begingroup$
Are you refering to youtube.com/watch?v=v5KWzOOhZrw&app=desktop ?
$endgroup$
– Roddy MacPhee
Feb 21 at 14:09
$begingroup$
That’s where i first heard about it :D but i don‘t think i‘m refering to the video per se^^
$endgroup$
– Lexyth
Feb 21 at 14:13
$begingroup$
The show in the video that a cycle path alone can't work.
$endgroup$
– Roddy MacPhee
Feb 21 at 14:21
$begingroup$
Uhm... yes it can. If you do 0,1,3 then the differences will be 1,2,3, so it works. Btw, they don‘t say it in the video, but you can number the labels with <=n where n is the number of joints. So for 3 joints it’s 0-3
$endgroup$
– Lexyth
Feb 21 at 14:25
$begingroup$
en.m.wikipedia.org/wiki/Tree_(graph_theory) cycles are no longer trees.
$endgroup$
– Roddy MacPhee
Feb 21 at 14:41