Simplest definition for graph genus?

Clash Royale CLAN TAG#URR8PPP
up vote
1
down vote
favorite
I'm trying to understand the graph genus. I've read some defs, but I still find confusing, how the genus can be reliably counted.
Simplest definition for graph genus?
How about:
Smallest number of holes in the graph possible so that it can be "laid on" a surface of equivalent number of holes?
graph-theory
add a comment |Â
up vote
1
down vote
favorite
I'm trying to understand the graph genus. I've read some defs, but I still find confusing, how the genus can be reliably counted.
Simplest definition for graph genus?
How about:
Smallest number of holes in the graph possible so that it can be "laid on" a surface of equivalent number of holes?
graph-theory
Please add a source (or more than one) for the definition of "graph genus" you are trying to understand. I would suspect that definitions of authors may vary because of trade-offs in proving equivalent characterizations. Already with planar graphs we have some nice algorithms (re: "reliably counted").
â hardmath
Aug 8 at 16:36
add a comment |Â
up vote
1
down vote
favorite
up vote
1
down vote
favorite
I'm trying to understand the graph genus. I've read some defs, but I still find confusing, how the genus can be reliably counted.
Simplest definition for graph genus?
How about:
Smallest number of holes in the graph possible so that it can be "laid on" a surface of equivalent number of holes?
graph-theory
I'm trying to understand the graph genus. I've read some defs, but I still find confusing, how the genus can be reliably counted.
Simplest definition for graph genus?
How about:
Smallest number of holes in the graph possible so that it can be "laid on" a surface of equivalent number of holes?
graph-theory
edited Aug 8 at 16:18
asked Aug 8 at 16:13
mavavilj
2,470730
2,470730
Please add a source (or more than one) for the definition of "graph genus" you are trying to understand. I would suspect that definitions of authors may vary because of trade-offs in proving equivalent characterizations. Already with planar graphs we have some nice algorithms (re: "reliably counted").
â hardmath
Aug 8 at 16:36
add a comment |Â
Please add a source (or more than one) for the definition of "graph genus" you are trying to understand. I would suspect that definitions of authors may vary because of trade-offs in proving equivalent characterizations. Already with planar graphs we have some nice algorithms (re: "reliably counted").
â hardmath
Aug 8 at 16:36
Please add a source (or more than one) for the definition of "graph genus" you are trying to understand. I would suspect that definitions of authors may vary because of trade-offs in proving equivalent characterizations. Already with planar graphs we have some nice algorithms (re: "reliably counted").
â hardmath
Aug 8 at 16:36
Please add a source (or more than one) for the definition of "graph genus" you are trying to understand. I would suspect that definitions of authors may vary because of trade-offs in proving equivalent characterizations. Already with planar graphs we have some nice algorithms (re: "reliably counted").
â hardmath
Aug 8 at 16:36
add a comment |Â
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2876274%2fsimplest-definition-for-graph-genus%23new-answer', 'question_page');
);
Post as a guest
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
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
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
Please add a source (or more than one) for the definition of "graph genus" you are trying to understand. I would suspect that definitions of authors may vary because of trade-offs in proving equivalent characterizations. Already with planar graphs we have some nice algorithms (re: "reliably counted").
â hardmath
Aug 8 at 16:36