$n$ vertex graph with more edges than its Turan number: $e(G) = t_r(n) + 1$
$begingroup$
I have been struggling with this problem for quite some time now and I cannot think of a way to proceed with either part:
Suppose that G is a graph with $n > r + 1$ vertices and $t_r(n) + 1$ edges:
(a) Prove that for every $p$ with $r + 1 < p <= n$ there is a subgraph $H$ of $G$ with $|H| = p$ and $e(H) > t_r(p) + 1$.
(b) Prove that $G$ contains two copies of $K_{r+1}$ with exactly $r$ common vertices.
For part a), I have so far tried to use induction on $n$. For the base case with $n = r+2$ we have only $H = G$ and $n = p$ to check, which is clearly true. For the $n$th case I think we want to find a vertex $v$ in $G$ of degree $delta(T_r(n))$, so that $H = G-v$ satisfies the induction hypothesis and gives all of the required subgraphs.
This is where I am stuck, I cannot seem to find anything close to this required vertex. As $e(G) = t_r(n) + 1$ we know $K_{r+1} leq G$, so there is a vertex $v$ with $d(v) geq r$, which is not enough as $(q-1)r leq delta(T_r(v)) leq qr-1$.
Perhaps useful I thought would also be the fact that if $|G| = n, e(G) = t_r(n), K_{r+1} nleq G$ then $delta(G) leq delta(T_r(v)) leq Delta(T_r(v)) leq Delta(G)$, this would give us a large enough vertex to delete, but we need $G$ to not contain $K_{r+1}$.
Likewise I did not get very far in the second part of the question, apart from the fact that a $K_{r+1}$ would exist in G in that case, but I cannot see how to get a second copy.
I noticed that someone has asked this identical problem a few years ago, but unfortunately, that one does not have any responses - which is why I have posted again as I do not have enough reputation to start a bounty without losing some rights on this site.
combinatorics graph-theory extremal-graph-theory
asked Jan 5 at 23:59
CowNorrisCowNorris
309114
$endgroup$
add a comment |
$begingroup$
I have been struggling with this problem for quite some time now and I cannot think of a way to proceed with either part:
Suppose that G is a graph with $n > r + 1$ vertices and $t_r(n) + 1$ edges:
(a) Prove that for every $p$ with $r + 1 < p <= n$ there is a subgraph $H$ of $G$ with $|H| = p$ and $e(H) > t_r(p) + 1$.
(b) Prove that $G$ contains two copies of $K_{r+1}$ with exactly $r$ common vertices.
For part a), I have so far tried to use induction on $n$. For the base case with $n = r+2$ we have only $H = G$ and $n = p$ to check, which is clearly true. For the $n$th case I think we want to find a vertex $v$ in $G$ of degree $delta(T_r(n))$, so that $H = G-v$ satisfies the induction hypothesis and gives all of the required subgraphs.
This is where I am stuck, I cannot seem to find anything close to this required vertex. As $e(G) = t_r(n) + 1$ we know $K_{r+1} leq G$, so there is a vertex $v$ with $d(v) geq r$, which is not enough as $(q-1)r leq delta(T_r(v)) leq qr-1$.
Perhaps useful I thought would also be the fact that if $|G| = n, e(G) = t_r(n), K_{r+1} nleq G$ then $delta(G) leq delta(T_r(v)) leq Delta(T_r(v)) leq Delta(G)$, this would give us a large enough vertex to delete, but we need $G$ to not contain $K_{r+1}$.
Likewise I did not get very far in the second part of the question, apart from the fact that a $K_{r+1}$ would exist in G in that case, but I cannot see how to get a second copy.
I noticed that someone has asked this identical problem a few years ago, but unfortunately, that one does not have any responses - which is why I have posted again as I do not have enough reputation to start a bounty without losing some rights on this site.
combinatorics graph-theory extremal-graph-theory
asked Jan 5 at 23:59
CowNorrisCowNorris
309114
$endgroup$
add a comment |
$begingroup$
I have been struggling with this problem for quite some time now and I cannot think of a way to proceed with either part:
Suppose that G is a graph with $n > r + 1$ vertices and $t_r(n) + 1$ edges:
(a) Prove that for every $p$ with $r + 1 < p <= n$ there is a subgraph $H$ of $G$ with $|H| = p$ and $e(H) > t_r(p) + 1$.
(b) Prove that $G$ contains two copies of $K_{r+1}$ with exactly $r$ common vertices.
For part a), I have so far tried to use induction on $n$. For the base case with $n = r+2$ we have only $H = G$ and $n = p$ to check, which is clearly true. For the $n$th case I think we want to find a vertex $v$ in $G$ of degree $delta(T_r(n))$, so that $H = G-v$ satisfies the induction hypothesis and gives all of the required subgraphs.
This is where I am stuck, I cannot seem to find anything close to this required vertex. As $e(G) = t_r(n) + 1$ we know $K_{r+1} leq G$, so there is a vertex $v$ with $d(v) geq r$, which is not enough as $(q-1)r leq delta(T_r(v)) leq qr-1$.
Perhaps useful I thought would also be the fact that if $|G| = n, e(G) = t_r(n), K_{r+1} nleq G$ then $delta(G) leq delta(T_r(v)) leq Delta(T_r(v)) leq Delta(G)$, this would give us a large enough vertex to delete, but we need $G$ to not contain $K_{r+1}$.
Likewise I did not get very far in the second part of the question, apart from the fact that a $K_{r+1}$ would exist in G in that case, but I cannot see how to get a second copy.
I noticed that someone has asked this identical problem a few years ago, but unfortunately, that one does not have any responses - which is why I have posted again as I do not have enough reputation to start a bounty without losing some rights on this site.
combinatorics graph-theory extremal-graph-theory
asked Jan 5 at 23:59
CowNorrisCowNorris
309114
$endgroup$
I have been struggling with this problem for quite some time now and I cannot think of a way to proceed with either part:
Suppose that G is a graph with $n > r + 1$ vertices and $t_r(n) + 1$ edges:
(a) Prove that for every $p$ with $r + 1 < p <= n$ there is a subgraph $H$ of $G$ with $|H| = p$ and $e(H) > t_r(p) + 1$.
(b) Prove that $G$ contains two copies of $K_{r+1}$ with exactly $r$ common vertices.
For part a), I have so far tried to use induction on $n$. For the base case with $n = r+2$ we have only $H = G$ and $n = p$ to check, which is clearly true. For the $n$th case I think we want to find a vertex $v$ in $G$ of degree $delta(T_r(n))$, so that $H = G-v$ satisfies the induction hypothesis and gives all of the required subgraphs.
This is where I am stuck, I cannot seem to find anything close to this required vertex. As $e(G) = t_r(n) + 1$ we know $K_{r+1} leq G$, so there is a vertex $v$ with $d(v) geq r$, which is not enough as $(q-1)r leq delta(T_r(v)) leq qr-1$.
Perhaps useful I thought would also be the fact that if $|G| = n, e(G) = t_r(n), K_{r+1} nleq G$ then $delta(G) leq delta(T_r(v)) leq Delta(T_r(v)) leq Delta(G)$, this would give us a large enough vertex to delete, but we need $G$ to not contain $K_{r+1}$.
Likewise I did not get very far in the second part of the question, apart from the fact that a $K_{r+1}$ would exist in G in that case, but I cannot see how to get a second copy.
I noticed that someone has asked this identical problem a few years ago, but unfortunately, that one does not have any responses - which is why I have posted again as I do not have enough reputation to start a bounty without losing some rights on this site.
combinatorics graph-theory extremal-graph-theory
combinatorics graph-theory extremal-graph-theory
asked Jan 5 at 23:59
CowNorrisCowNorris
309114
asked Jan 5 at 23:59
CowNorrisCowNorris
309114
edited Jan 6 at 0:19
CowNorris
asked Jan 5 at 23:59
CowNorrisCowNorris
309114
asked Jan 5 at 23:59
CowNorrisCowNorris
309114
asked Jan 5 at 23:59
CowNorrisCowNorris
309114
309114
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%2f3063340%2fn-vertex-graph-with-more-edges-than-its-turan-number-eg-t-rn-1%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%2f3063340%2fn-vertex-graph-with-more-edges-than-its-turan-number-eg-t-rn-1%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
