Is the graceful labeling conjecture still unsolved?
$begingroup$
From the Wikipedia article on graceful labeling:
... A major unproven conjecture in graph theory is the Ringel–Kotzig conjecture, named after Gerhard Ringel and Anton Kotzig, which hypothesizes that all trees are graceful. The Ringel-Kotzig conjecture is also known as the "graceful labeling conjecture". ...
Is the conjecture still unsolved?
(for example I found Dhananjay P. Mehendale, "On Gracefully Labeling Trees", which claims that the conjecture is true).
trees
asked Feb 2 '13 at 13:48
VorVor
355117
$endgroup$
add a comment |
$begingroup$
From the Wikipedia article on graceful labeling:
... A major unproven conjecture in graph theory is the Ringel–Kotzig conjecture, named after Gerhard Ringel and Anton Kotzig, which hypothesizes that all trees are graceful. The Ringel-Kotzig conjecture is also known as the "graceful labeling conjecture". ...
Is the conjecture still unsolved?
(for example I found Dhananjay P. Mehendale, "On Gracefully Labeling Trees", which claims that the conjecture is true).
trees
asked Feb 2 '13 at 13:48
VorVor
355117
$endgroup$
$begingroup$
See the latest version at arxiv.org/ftp/math/papers/0503/0503484.pdf you are refering to old version.
$endgroup$
– user73830
Apr 22 '13 at 17:06
$begingroup$
I've already said this somewhere, but you should take any math paper not written in TeX with an additional dose of suspicion.
$endgroup$
– tomasz
Jul 6 '13 at 14:29
add a comment |
$begingroup$
From the Wikipedia article on graceful labeling:
... A major unproven conjecture in graph theory is the Ringel–Kotzig conjecture, named after Gerhard Ringel and Anton Kotzig, which hypothesizes that all trees are graceful. The Ringel-Kotzig conjecture is also known as the "graceful labeling conjecture". ...
Is the conjecture still unsolved?
(for example I found Dhananjay P. Mehendale, "On Gracefully Labeling Trees", which claims that the conjecture is true).
trees
asked Feb 2 '13 at 13:48
VorVor
355117
$endgroup$
From the Wikipedia article on graceful labeling:
... A major unproven conjecture in graph theory is the Ringel–Kotzig conjecture, named after Gerhard Ringel and Anton Kotzig, which hypothesizes that all trees are graceful. The Ringel-Kotzig conjecture is also known as the "graceful labeling conjecture". ...
Is the conjecture still unsolved?
(for example I found Dhananjay P. Mehendale, "On Gracefully Labeling Trees", which claims that the conjecture is true).
trees
trees
asked Feb 2 '13 at 13:48
VorVor
355117
asked Feb 2 '13 at 13:48
VorVor
355117
asked Feb 2 '13 at 13:48
VorVor
355117
asked Feb 2 '13 at 13:48
VorVor
355117
asked Feb 2 '13 at 13:48
VorVor
355117
355117
$begingroup$
See the latest version at arxiv.org/ftp/math/papers/0503/0503484.pdf you are refering to old version.
$endgroup$
– user73830
Apr 22 '13 at 17:06
$begingroup$
I've already said this somewhere, but you should take any math paper not written in TeX with an additional dose of suspicion.
$endgroup$
– tomasz
Jul 6 '13 at 14:29
add a comment |
$begingroup$
See the latest version at arxiv.org/ftp/math/papers/0503/0503484.pdf you are refering to old version.
$endgroup$
– user73830
Apr 22 '13 at 17:06
$begingroup$
I've already said this somewhere, but you should take any math paper not written in TeX with an additional dose of suspicion.
$endgroup$
– tomasz
Jul 6 '13 at 14:29
$begingroup$
See the latest version at arxiv.org/ftp/math/papers/0503/0503484.pdf you are refering to old version.
$endgroup$
– user73830
Apr 22 '13 at 17:06
$begingroup$
See the latest version at arxiv.org/ftp/math/papers/0503/0503484.pdf you are refering to old version.
$endgroup$
– user73830
Apr 22 '13 at 17:06
$begingroup$
I've already said this somewhere, but you should take any math paper not written in TeX with an additional dose of suspicion.
$endgroup$
– tomasz
Jul 6 '13 at 14:29
$begingroup$
I've already said this somewhere, but you should take any math paper not written in TeX with an additional dose of suspicion.
$endgroup$
– tomasz
Jul 6 '13 at 14:29
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
It's still open. At least if we are to believe this recent (2011) Stanford Thesis, which gives an extensive survey of the problem.
The problem is one of those 'disease' problems to which lots of people come up with bad proofs for. It does however appear to be solved for certain cases of trees.
edited Jan 16 at 16:50
Casteels
10k42234
answered Feb 11 '14 at 19:00
Thomas AhleThomas Ahle
1,5291323
$endgroup$
add a comment |
$begingroup$
You can also find and trace news about best-known kinds of graph labeling, in a dynamic survey by J. A. Gallian. According to it's last version, the conjecture is still unproved.
answered Aug 22 '14 at 6:40
TougheeToughee
284
$endgroup$
add a comment |
$begingroup$
Another paper just came out on it here: https://arxiv.org/abs/1811.07614 I can't read it well enough to say whether it's solved or not though.
answered Mar 26 at 19:54
djhaskin987djhaskin987
13916
$endgroup$
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: "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%2f292797%2fis-the-graceful-labeling-conjecture-still-unsolved%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
It's still open. At least if we are to believe this recent (2011) Stanford Thesis, which gives an extensive survey of the problem.
The problem is one of those 'disease' problems to which lots of people come up with bad proofs for. It does however appear to be solved for certain cases of trees.
edited Jan 16 at 16:50
Casteels
10k42234
answered Feb 11 '14 at 19:00
Thomas AhleThomas Ahle
1,5291323
$endgroup$
add a comment |
$begingroup$
It's still open. At least if we are to believe this recent (2011) Stanford Thesis, which gives an extensive survey of the problem.
The problem is one of those 'disease' problems to which lots of people come up with bad proofs for. It does however appear to be solved for certain cases of trees.
edited Jan 16 at 16:50
Casteels
10k42234
answered Feb 11 '14 at 19:00
Thomas AhleThomas Ahle
1,5291323
$endgroup$
add a comment |
$begingroup$
It's still open. At least if we are to believe this recent (2011) Stanford Thesis, which gives an extensive survey of the problem.
The problem is one of those 'disease' problems to which lots of people come up with bad proofs for. It does however appear to be solved for certain cases of trees.
edited Jan 16 at 16:50
Casteels
10k42234
answered Feb 11 '14 at 19:00
Thomas AhleThomas Ahle
1,5291323
$endgroup$
It's still open. At least if we are to believe this recent (2011) Stanford Thesis, which gives an extensive survey of the problem.
The problem is one of those 'disease' problems to which lots of people come up with bad proofs for. It does however appear to be solved for certain cases of trees.
edited Jan 16 at 16:50
Casteels
10k42234
answered Feb 11 '14 at 19:00
Thomas AhleThomas Ahle
1,5291323
edited Jan 16 at 16:50
Casteels
10k42234
edited Jan 16 at 16:50
Casteels
10k42234
edited Jan 16 at 16:50
Casteels
10k42234
10k42234
answered Feb 11 '14 at 19:00
Thomas AhleThomas Ahle
1,5291323
answered Feb 11 '14 at 19:00
Thomas AhleThomas Ahle
1,5291323
answered Feb 11 '14 at 19:00
Thomas AhleThomas Ahle
1,5291323
1,5291323
add a comment |
add a comment |
$begingroup$
You can also find and trace news about best-known kinds of graph labeling, in a dynamic survey by J. A. Gallian. According to it's last version, the conjecture is still unproved.
answered Aug 22 '14 at 6:40
TougheeToughee
284
$endgroup$
add a comment |
$begingroup$
You can also find and trace news about best-known kinds of graph labeling, in a dynamic survey by J. A. Gallian. According to it's last version, the conjecture is still unproved.
answered Aug 22 '14 at 6:40
TougheeToughee
284
$endgroup$
add a comment |
$begingroup$
You can also find and trace news about best-known kinds of graph labeling, in a dynamic survey by J. A. Gallian. According to it's last version, the conjecture is still unproved.
answered Aug 22 '14 at 6:40
TougheeToughee
284
$endgroup$
You can also find and trace news about best-known kinds of graph labeling, in a dynamic survey by J. A. Gallian. According to it's last version, the conjecture is still unproved.
answered Aug 22 '14 at 6:40
TougheeToughee
284
edited Apr 23 '16 at 12:13
answered Aug 22 '14 at 6:40
TougheeToughee
284
answered Aug 22 '14 at 6:40
TougheeToughee
284
answered Aug 22 '14 at 6:40
TougheeToughee
284
284
add a comment |
add a comment |
$begingroup$
Another paper just came out on it here: https://arxiv.org/abs/1811.07614 I can't read it well enough to say whether it's solved or not though.
answered Mar 26 at 19:54
djhaskin987djhaskin987
13916
$endgroup$
add a comment |
$begingroup$
Another paper just came out on it here: https://arxiv.org/abs/1811.07614 I can't read it well enough to say whether it's solved or not though.
answered Mar 26 at 19:54
djhaskin987djhaskin987
13916
$endgroup$
add a comment |
$begingroup$
Another paper just came out on it here: https://arxiv.org/abs/1811.07614 I can't read it well enough to say whether it's solved or not though.
answered Mar 26 at 19:54
djhaskin987djhaskin987
13916
$endgroup$
Another paper just came out on it here: https://arxiv.org/abs/1811.07614 I can't read it well enough to say whether it's solved or not though.
answered Mar 26 at 19:54
djhaskin987djhaskin987
13916
answered Mar 26 at 19:54
djhaskin987djhaskin987
13916
answered Mar 26 at 19:54
djhaskin987djhaskin987
13916
answered Mar 26 at 19:54
djhaskin987djhaskin987
13916
13916
add a comment |
add a comment |
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%2f292797%2fis-the-graceful-labeling-conjecture-still-unsolved%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$
See the latest version at arxiv.org/ftp/math/papers/0503/0503484.pdf you are refering to old version.
$endgroup$
– user73830
Apr 22 '13 at 17:06
$begingroup$
I've already said this somewhere, but you should take any math paper not written in TeX with an additional dose of suspicion.
$endgroup$
– tomasz
Jul 6 '13 at 14:29