Prove every infinite directed graph has infinite strict linear order or…
$begingroup$
I'm trying to prove the following: Every infinite directed graph has
an infinite subset of vertices that induces one of the following:
- a strict linear order
- a weak linear order
- an independent set without loops
- loops at each vertex and otherwise no edges
I was thinking of seeing $(V,E)$ as a set with a relation $(P,leq)$ and since it can be seen as an infinite poset with reachability I can use Ramsey's theorem by coloring every pair as either connected or not, then we have an infinite chain or infinite antichain.
The chain is an infinite path, if it has loops at every vertex then it is reflexive and a weak linear order. If not then it is a strong linear order.
If it has an infinite anti chain, it is possible that the vertices in the antichain have loops aka $v leq v, forall vin A$, $A$ antichain, if not then they are completely independent with $vnot in Xin {Achoose 2 }$, for all edges $X$.
I'm not sure if these thoughts can be put in a coherent proof.
proof-verification graph-theory ramsey-theory
asked Jan 9 at 11:28
orangeorange
675215
$endgroup$
add a comment |
$begingroup$
I'm trying to prove the following: Every infinite directed graph has
an infinite subset of vertices that induces one of the following:
- a strict linear order
- a weak linear order
- an independent set without loops
- loops at each vertex and otherwise no edges
I was thinking of seeing $(V,E)$ as a set with a relation $(P,leq)$ and since it can be seen as an infinite poset with reachability I can use Ramsey's theorem by coloring every pair as either connected or not, then we have an infinite chain or infinite antichain.
The chain is an infinite path, if it has loops at every vertex then it is reflexive and a weak linear order. If not then it is a strong linear order.
If it has an infinite anti chain, it is possible that the vertices in the antichain have loops aka $v leq v, forall vin A$, $A$ antichain, if not then they are completely independent with $vnot in Xin {Achoose 2 }$, for all edges $X$.
I'm not sure if these thoughts can be put in a coherent proof.
proof-verification graph-theory ramsey-theory
asked Jan 9 at 11:28
orangeorange
675215
$endgroup$
$begingroup$
If every pair of vertices is joined by directed edges in both directions, thhen none of your four alternatives holds. I guess you are assuming some antisymmetry: " if edges $ab$ and $ba$ are both present, then $a=b$" or something like that. I don't think that is the usual meaning of the term "directed graph".
$endgroup$
– bof
Jan 9 at 12:30
$begingroup$
Would such a graph contain an infinite vertex set that would induce an infinite clique?
$endgroup$
– orange
Jan 9 at 12:35
$begingroup$
Here is how to use Ramsey's theorem. Choose an infinite sequence $v_1,v_2,dots$ of distinct vertices. Color the unordered pairs of natural numbers with $8$ colors as follows. Suppose $i,jinmathbb N$, $ilt j$. Give the pair ${i,j}$ the color $(x,y,z)$ where $x$ is the truth value of "there is a loop at $v_i$", $y$ is the truth value of "there is a directed edge $v_iv_j$", and $z$ is the truth value of "there is a directed edge $v_jv_i$". Apply Ramsey's theorem to get an infinite monochromatic set. Which of the $8$ colors are possible depends on what you assume about the starting graph.
$endgroup$
– bof
Jan 9 at 12:37
add a comment |
$begingroup$
I'm trying to prove the following: Every infinite directed graph has
an infinite subset of vertices that induces one of the following:
- a strict linear order
- a weak linear order
- an independent set without loops
- loops at each vertex and otherwise no edges
I was thinking of seeing $(V,E)$ as a set with a relation $(P,leq)$ and since it can be seen as an infinite poset with reachability I can use Ramsey's theorem by coloring every pair as either connected or not, then we have an infinite chain or infinite antichain.
The chain is an infinite path, if it has loops at every vertex then it is reflexive and a weak linear order. If not then it is a strong linear order.
If it has an infinite anti chain, it is possible that the vertices in the antichain have loops aka $v leq v, forall vin A$, $A$ antichain, if not then they are completely independent with $vnot in Xin {Achoose 2 }$, for all edges $X$.
I'm not sure if these thoughts can be put in a coherent proof.
proof-verification graph-theory ramsey-theory
asked Jan 9 at 11:28
orangeorange
675215
$endgroup$
I'm trying to prove the following: Every infinite directed graph has
an infinite subset of vertices that induces one of the following:
- a strict linear order
- a weak linear order
- an independent set without loops
- loops at each vertex and otherwise no edges
I was thinking of seeing $(V,E)$ as a set with a relation $(P,leq)$ and since it can be seen as an infinite poset with reachability I can use Ramsey's theorem by coloring every pair as either connected or not, then we have an infinite chain or infinite antichain.
The chain is an infinite path, if it has loops at every vertex then it is reflexive and a weak linear order. If not then it is a strong linear order.
If it has an infinite anti chain, it is possible that the vertices in the antichain have loops aka $v leq v, forall vin A$, $A$ antichain, if not then they are completely independent with $vnot in Xin {Achoose 2 }$, for all edges $X$.
I'm not sure if these thoughts can be put in a coherent proof.
proof-verification graph-theory ramsey-theory
proof-verification graph-theory ramsey-theory
asked Jan 9 at 11:28
orangeorange
675215
asked Jan 9 at 11:28
orangeorange
675215
asked Jan 9 at 11:28
orangeorange
675215
asked Jan 9 at 11:28
orangeorange
675215
asked Jan 9 at 11:28
orangeorange
675215
675215
$begingroup$
If every pair of vertices is joined by directed edges in both directions, thhen none of your four alternatives holds. I guess you are assuming some antisymmetry: " if edges $ab$ and $ba$ are both present, then $a=b$" or something like that. I don't think that is the usual meaning of the term "directed graph".
$endgroup$
– bof
Jan 9 at 12:30
$begingroup$
Would such a graph contain an infinite vertex set that would induce an infinite clique?
$endgroup$
– orange
Jan 9 at 12:35
$begingroup$
Here is how to use Ramsey's theorem. Choose an infinite sequence $v_1,v_2,dots$ of distinct vertices. Color the unordered pairs of natural numbers with $8$ colors as follows. Suppose $i,jinmathbb N$, $ilt j$. Give the pair ${i,j}$ the color $(x,y,z)$ where $x$ is the truth value of "there is a loop at $v_i$", $y$ is the truth value of "there is a directed edge $v_iv_j$", and $z$ is the truth value of "there is a directed edge $v_jv_i$". Apply Ramsey's theorem to get an infinite monochromatic set. Which of the $8$ colors are possible depends on what you assume about the starting graph.
$endgroup$
– bof
Jan 9 at 12:37
add a comment |
$begingroup$
If every pair of vertices is joined by directed edges in both directions, thhen none of your four alternatives holds. I guess you are assuming some antisymmetry: " if edges $ab$ and $ba$ are both present, then $a=b$" or something like that. I don't think that is the usual meaning of the term "directed graph".
$endgroup$
– bof
Jan 9 at 12:30
$begingroup$
Would such a graph contain an infinite vertex set that would induce an infinite clique?
$endgroup$
– orange
Jan 9 at 12:35
$begingroup$
Here is how to use Ramsey's theorem. Choose an infinite sequence $v_1,v_2,dots$ of distinct vertices. Color the unordered pairs of natural numbers with $8$ colors as follows. Suppose $i,jinmathbb N$, $ilt j$. Give the pair ${i,j}$ the color $(x,y,z)$ where $x$ is the truth value of "there is a loop at $v_i$", $y$ is the truth value of "there is a directed edge $v_iv_j$", and $z$ is the truth value of "there is a directed edge $v_jv_i$". Apply Ramsey's theorem to get an infinite monochromatic set. Which of the $8$ colors are possible depends on what you assume about the starting graph.
$endgroup$
– bof
Jan 9 at 12:37
$begingroup$
If every pair of vertices is joined by directed edges in both directions, thhen none of your four alternatives holds. I guess you are assuming some antisymmetry: " if edges $ab$ and $ba$ are both present, then $a=b$" or something like that. I don't think that is the usual meaning of the term "directed graph".
$endgroup$
– bof
Jan 9 at 12:30
$begingroup$
If every pair of vertices is joined by directed edges in both directions, thhen none of your four alternatives holds. I guess you are assuming some antisymmetry: " if edges $ab$ and $ba$ are both present, then $a=b$" or something like that. I don't think that is the usual meaning of the term "directed graph".
$endgroup$
– bof
Jan 9 at 12:30
$begingroup$
Would such a graph contain an infinite vertex set that would induce an infinite clique?
$endgroup$
– orange
Jan 9 at 12:35
$begingroup$
Would such a graph contain an infinite vertex set that would induce an infinite clique?
$endgroup$
– orange
Jan 9 at 12:35
$begingroup$
Here is how to use Ramsey's theorem. Choose an infinite sequence $v_1,v_2,dots$ of distinct vertices. Color the unordered pairs of natural numbers with $8$ colors as follows. Suppose $i,jinmathbb N$, $ilt j$. Give the pair ${i,j}$ the color $(x,y,z)$ where $x$ is the truth value of "there is a loop at $v_i$", $y$ is the truth value of "there is a directed edge $v_iv_j$", and $z$ is the truth value of "there is a directed edge $v_jv_i$". Apply Ramsey's theorem to get an infinite monochromatic set. Which of the $8$ colors are possible depends on what you assume about the starting graph.
$endgroup$
– bof
Jan 9 at 12:37
$begingroup$
Here is how to use Ramsey's theorem. Choose an infinite sequence $v_1,v_2,dots$ of distinct vertices. Color the unordered pairs of natural numbers with $8$ colors as follows. Suppose $i,jinmathbb N$, $ilt j$. Give the pair ${i,j}$ the color $(x,y,z)$ where $x$ is the truth value of "there is a loop at $v_i$", $y$ is the truth value of "there is a directed edge $v_iv_j$", and $z$ is the truth value of "there is a directed edge $v_jv_i$". Apply Ramsey's theorem to get an infinite monochromatic set. Which of the $8$ colors are possible depends on what you assume about the starting graph.
$endgroup$
– bof
Jan 9 at 12:37
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%2f3067344%2fprove-every-infinite-directed-graph-has-infinite-strict-linear-order-or%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%2f3067344%2fprove-every-infinite-directed-graph-has-infinite-strict-linear-order-or%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$
If every pair of vertices is joined by directed edges in both directions, thhen none of your four alternatives holds. I guess you are assuming some antisymmetry: " if edges $ab$ and $ba$ are both present, then $a=b$" or something like that. I don't think that is the usual meaning of the term "directed graph".
$endgroup$
– bof
Jan 9 at 12:30
$begingroup$
Would such a graph contain an infinite vertex set that would induce an infinite clique?
$endgroup$
– orange
Jan 9 at 12:35
$begingroup$
Here is how to use Ramsey's theorem. Choose an infinite sequence $v_1,v_2,dots$ of distinct vertices. Color the unordered pairs of natural numbers with $8$ colors as follows. Suppose $i,jinmathbb N$, $ilt j$. Give the pair ${i,j}$ the color $(x,y,z)$ where $x$ is the truth value of "there is a loop at $v_i$", $y$ is the truth value of "there is a directed edge $v_iv_j$", and $z$ is the truth value of "there is a directed edge $v_jv_i$". Apply Ramsey's theorem to get an infinite monochromatic set. Which of the $8$ colors are possible depends on what you assume about the starting graph.
$endgroup$
– bof
Jan 9 at 12:37