Given a free involution $i$ on a finite graph $G$, is there a minimal embedding of $G$ such that $i$ is...
$begingroup$
This question comes from my own Bachelor-thesis work. I am exploring the 1-2-inifity conjecture, or Negamis conjecture, and I am trying to see what happens if one tried to extend Negamis result that a connected graph has a 2-fold planar cover iff it is embeddable in the projective plane to higher genus surfaces.
The question in itself is only indirectly linked here, but I find it interesting in its own right. To me it looks like something that should be obviously true, but I have stared at it for a little bit too much time to really know. And I just cannot figure it out. Frankly, I'm not sure whether this is an open question or not.
combinatorics graph-theory non-orientable-surfaces
asked Dec 7 '18 at 15:37
haavardhaavard
564
$endgroup$
add a comment |
$begingroup$
This question comes from my own Bachelor-thesis work. I am exploring the 1-2-inifity conjecture, or Negamis conjecture, and I am trying to see what happens if one tried to extend Negamis result that a connected graph has a 2-fold planar cover iff it is embeddable in the projective plane to higher genus surfaces.
The question in itself is only indirectly linked here, but I find it interesting in its own right. To me it looks like something that should be obviously true, but I have stared at it for a little bit too much time to really know. And I just cannot figure it out. Frankly, I'm not sure whether this is an open question or not.
combinatorics graph-theory non-orientable-surfaces
asked Dec 7 '18 at 15:37
haavardhaavard
564
$endgroup$
add a comment |
$begingroup$
This question comes from my own Bachelor-thesis work. I am exploring the 1-2-inifity conjecture, or Negamis conjecture, and I am trying to see what happens if one tried to extend Negamis result that a connected graph has a 2-fold planar cover iff it is embeddable in the projective plane to higher genus surfaces.
The question in itself is only indirectly linked here, but I find it interesting in its own right. To me it looks like something that should be obviously true, but I have stared at it for a little bit too much time to really know. And I just cannot figure it out. Frankly, I'm not sure whether this is an open question or not.
combinatorics graph-theory non-orientable-surfaces
asked Dec 7 '18 at 15:37
haavardhaavard
564
$endgroup$
This question comes from my own Bachelor-thesis work. I am exploring the 1-2-inifity conjecture, or Negamis conjecture, and I am trying to see what happens if one tried to extend Negamis result that a connected graph has a 2-fold planar cover iff it is embeddable in the projective plane to higher genus surfaces.
The question in itself is only indirectly linked here, but I find it interesting in its own right. To me it looks like something that should be obviously true, but I have stared at it for a little bit too much time to really know. And I just cannot figure it out. Frankly, I'm not sure whether this is an open question or not.
combinatorics graph-theory non-orientable-surfaces
combinatorics graph-theory non-orientable-surfaces
asked Dec 7 '18 at 15:37
haavardhaavard
564
asked Dec 7 '18 at 15:37
haavardhaavard
564
asked Dec 7 '18 at 15:37
haavardhaavard
564
asked Dec 7 '18 at 15:37
haavardhaavard
564
asked Dec 7 '18 at 15:37
haavardhaavard
564
564
add a comment |
add a comment |
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%2f3030021%2fgiven-a-free-involution-i-on-a-finite-graph-g-is-there-a-minimal-embedding%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%2f3030021%2fgiven-a-free-involution-i-on-a-finite-graph-g-is-there-a-minimal-embedding%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
