Equivalent characterization of Eulerian circuits
$begingroup$
Background
A connected graph has an Eulerian circuit if every vertex has even degree.
I am thinking about a certain classification of connected graphs where, for a connected graph $G$, every cut splits (intersects) an even number of edges.
For example, while the following graph does not have an Eulerian circuit, the displayed cut 'splits an even number of edges':
Claim: A connected graph $G$ has an Eulerian circuit iff every cut of $G$ splits an even number of edges.
Proof attempt:
($rightarrow$) If $G$ has an Eulerian circuit then ... ?
($leftarrow$) Suppose every cut splits an even number of edges. Then we can make a cut around each individual vertex that will split an even number of edges. Hence the degree of each vertex is even. Therefore $G$ has an Eulerian circuit.
I'm lost in the forwards direction of the proof. Any hint would be appreciated.
combinatorics graph-theory eulerian-path
asked Dec 28 '18 at 20:55
T. FoT. Fo
496311
$endgroup$
add a comment |
$begingroup$
Background
A connected graph has an Eulerian circuit if every vertex has even degree.
I am thinking about a certain classification of connected graphs where, for a connected graph $G$, every cut splits (intersects) an even number of edges.
For example, while the following graph does not have an Eulerian circuit, the displayed cut 'splits an even number of edges':
Claim: A connected graph $G$ has an Eulerian circuit iff every cut of $G$ splits an even number of edges.
Proof attempt:
($rightarrow$) If $G$ has an Eulerian circuit then ... ?
($leftarrow$) Suppose every cut splits an even number of edges. Then we can make a cut around each individual vertex that will split an even number of edges. Hence the degree of each vertex is even. Therefore $G$ has an Eulerian circuit.
I'm lost in the forwards direction of the proof. Any hint would be appreciated.
combinatorics graph-theory eulerian-path
asked Dec 28 '18 at 20:55
T. FoT. Fo
496311
$endgroup$
add a comment |
$begingroup$
Background
A connected graph has an Eulerian circuit if every vertex has even degree.
I am thinking about a certain classification of connected graphs where, for a connected graph $G$, every cut splits (intersects) an even number of edges.
For example, while the following graph does not have an Eulerian circuit, the displayed cut 'splits an even number of edges':
Claim: A connected graph $G$ has an Eulerian circuit iff every cut of $G$ splits an even number of edges.
Proof attempt:
($rightarrow$) If $G$ has an Eulerian circuit then ... ?
($leftarrow$) Suppose every cut splits an even number of edges. Then we can make a cut around each individual vertex that will split an even number of edges. Hence the degree of each vertex is even. Therefore $G$ has an Eulerian circuit.
I'm lost in the forwards direction of the proof. Any hint would be appreciated.
combinatorics graph-theory eulerian-path
asked Dec 28 '18 at 20:55
T. FoT. Fo
496311
$endgroup$
Background
A connected graph has an Eulerian circuit if every vertex has even degree.
I am thinking about a certain classification of connected graphs where, for a connected graph $G$, every cut splits (intersects) an even number of edges.
For example, while the following graph does not have an Eulerian circuit, the displayed cut 'splits an even number of edges':
Claim: A connected graph $G$ has an Eulerian circuit iff every cut of $G$ splits an even number of edges.
Proof attempt:
($rightarrow$) If $G$ has an Eulerian circuit then ... ?
($leftarrow$) Suppose every cut splits an even number of edges. Then we can make a cut around each individual vertex that will split an even number of edges. Hence the degree of each vertex is even. Therefore $G$ has an Eulerian circuit.
I'm lost in the forwards direction of the proof. Any hint would be appreciated.
combinatorics graph-theory eulerian-path
combinatorics graph-theory eulerian-path
asked Dec 28 '18 at 20:55
T. FoT. Fo
496311
asked Dec 28 '18 at 20:55
T. FoT. Fo
496311
edited Dec 29 '18 at 0:33
T. Fo
asked Dec 28 '18 at 20:55
T. FoT. Fo
496311
asked Dec 28 '18 at 20:55
T. FoT. Fo
496311
asked Dec 28 '18 at 20:55
T. FoT. Fo
496311
496311
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Given any cut and any Eulerian circuit, the circuit has to cross from one side of the cut to another an even number of times, since it starts and ends on the same side of the cut.
Since the Eulerian circuit takes each edge once, the number of edges split by the cut is even.
answered Dec 28 '18 at 23:04
Misha LavrovMisha Lavrov
49.6k759109
$endgroup$
add a comment |
$begingroup$
Given: $forall v in V: textrm{deg}(v) equiv 0 pmod 2$. Partition $V$ into $S$ and $T$. We desire to show that the number of edges split by the cut is even.
By induction on the size of $T$.
Base case: when $|T| = 0$, there are $0$ edges split by the cut, which is even.
Inductive step: if it holds for all $|T| = n$, transfer vertex $u$ from $S$ to $T$. Since $u$ has an even number of edges in total, its edges to $S$ and its edges to $T$ have the same parity, so adding the edges $u-S$ to the cut and removing the edges $s-T$ from the cut doesn't change the parity of the number of edges split by the cut.
QED.
answered Dec 28 '18 at 21:25
Peter TaylorPeter Taylor
9,20712343
$endgroup$
add a comment |
Your Answer
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%2f3055272%2fequivalent-characterization-of-eulerian-circuits%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Given any cut and any Eulerian circuit, the circuit has to cross from one side of the cut to another an even number of times, since it starts and ends on the same side of the cut.
Since the Eulerian circuit takes each edge once, the number of edges split by the cut is even.
answered Dec 28 '18 at 23:04
Misha LavrovMisha Lavrov
49.6k759109
$endgroup$
add a comment |
$begingroup$
Given any cut and any Eulerian circuit, the circuit has to cross from one side of the cut to another an even number of times, since it starts and ends on the same side of the cut.
Since the Eulerian circuit takes each edge once, the number of edges split by the cut is even.
answered Dec 28 '18 at 23:04
Misha LavrovMisha Lavrov
49.6k759109
$endgroup$
add a comment |
$begingroup$
Given any cut and any Eulerian circuit, the circuit has to cross from one side of the cut to another an even number of times, since it starts and ends on the same side of the cut.
Since the Eulerian circuit takes each edge once, the number of edges split by the cut is even.
answered Dec 28 '18 at 23:04
Misha LavrovMisha Lavrov
49.6k759109
$endgroup$
Given any cut and any Eulerian circuit, the circuit has to cross from one side of the cut to another an even number of times, since it starts and ends on the same side of the cut.
Since the Eulerian circuit takes each edge once, the number of edges split by the cut is even.
answered Dec 28 '18 at 23:04
Misha LavrovMisha Lavrov
49.6k759109
answered Dec 28 '18 at 23:04
Misha LavrovMisha Lavrov
49.6k759109
answered Dec 28 '18 at 23:04
Misha LavrovMisha Lavrov
49.6k759109
answered Dec 28 '18 at 23:04
Misha LavrovMisha Lavrov
49.6k759109
49.6k759109
add a comment |
add a comment |
$begingroup$
Given: $forall v in V: textrm{deg}(v) equiv 0 pmod 2$. Partition $V$ into $S$ and $T$. We desire to show that the number of edges split by the cut is even.
By induction on the size of $T$.
Base case: when $|T| = 0$, there are $0$ edges split by the cut, which is even.
Inductive step: if it holds for all $|T| = n$, transfer vertex $u$ from $S$ to $T$. Since $u$ has an even number of edges in total, its edges to $S$ and its edges to $T$ have the same parity, so adding the edges $u-S$ to the cut and removing the edges $s-T$ from the cut doesn't change the parity of the number of edges split by the cut.
QED.
answered Dec 28 '18 at 21:25
Peter TaylorPeter Taylor
9,20712343
$endgroup$
add a comment |
$begingroup$
Given: $forall v in V: textrm{deg}(v) equiv 0 pmod 2$. Partition $V$ into $S$ and $T$. We desire to show that the number of edges split by the cut is even.
By induction on the size of $T$.
Base case: when $|T| = 0$, there are $0$ edges split by the cut, which is even.
Inductive step: if it holds for all $|T| = n$, transfer vertex $u$ from $S$ to $T$. Since $u$ has an even number of edges in total, its edges to $S$ and its edges to $T$ have the same parity, so adding the edges $u-S$ to the cut and removing the edges $s-T$ from the cut doesn't change the parity of the number of edges split by the cut.
QED.
answered Dec 28 '18 at 21:25
Peter TaylorPeter Taylor
9,20712343
$endgroup$
add a comment |
$begingroup$
Given: $forall v in V: textrm{deg}(v) equiv 0 pmod 2$. Partition $V$ into $S$ and $T$. We desire to show that the number of edges split by the cut is even.
By induction on the size of $T$.
Base case: when $|T| = 0$, there are $0$ edges split by the cut, which is even.
Inductive step: if it holds for all $|T| = n$, transfer vertex $u$ from $S$ to $T$. Since $u$ has an even number of edges in total, its edges to $S$ and its edges to $T$ have the same parity, so adding the edges $u-S$ to the cut and removing the edges $s-T$ from the cut doesn't change the parity of the number of edges split by the cut.
QED.
answered Dec 28 '18 at 21:25
Peter TaylorPeter Taylor
9,20712343
$endgroup$
Given: $forall v in V: textrm{deg}(v) equiv 0 pmod 2$. Partition $V$ into $S$ and $T$. We desire to show that the number of edges split by the cut is even.
By induction on the size of $T$.
Base case: when $|T| = 0$, there are $0$ edges split by the cut, which is even.
Inductive step: if it holds for all $|T| = n$, transfer vertex $u$ from $S$ to $T$. Since $u$ has an even number of edges in total, its edges to $S$ and its edges to $T$ have the same parity, so adding the edges $u-S$ to the cut and removing the edges $s-T$ from the cut doesn't change the parity of the number of edges split by the cut.
QED.
answered Dec 28 '18 at 21:25
Peter TaylorPeter Taylor
9,20712343
answered Dec 28 '18 at 21:25
Peter TaylorPeter Taylor
9,20712343
answered Dec 28 '18 at 21:25
Peter TaylorPeter Taylor
9,20712343
answered Dec 28 '18 at 21:25
Peter TaylorPeter Taylor
9,20712343
9,20712343
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%2f3055272%2fequivalent-characterization-of-eulerian-circuits%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
