How many copies of a graph $H$ containing a fixed edge in $[n]$?












1














Given a graph $H$. For a fixed edge $e$ in a complete graph $K_n$, how many copies of $H$ containing $e$ in $K_n$? Assume $n$ is large enough?



I am wondering if $n^{v_H-2}$ is an upper bound? Since an upper bound I can come up with is $binom{n-2}{v_H-2}v_H!$. But it seems larger than $n^{v_H-2}$ when $v_Hge 3$ and $n$ large enough.










share|cite|improve this question






















  • Isn't it exactly $$binom n{v_H}cdotfrac{v_H!}{|operatorname{Aut}(H)|}cdotfrac{e_H}{binom n2}$$ where $v_H=|V(H)|$ and $e_H=|E(H)|$?
    – bof
    Nov 19 '18 at 12:28


















1














Given a graph $H$. For a fixed edge $e$ in a complete graph $K_n$, how many copies of $H$ containing $e$ in $K_n$? Assume $n$ is large enough?



I am wondering if $n^{v_H-2}$ is an upper bound? Since an upper bound I can come up with is $binom{n-2}{v_H-2}v_H!$. But it seems larger than $n^{v_H-2}$ when $v_Hge 3$ and $n$ large enough.










share|cite|improve this question






















  • Isn't it exactly $$binom n{v_H}cdotfrac{v_H!}{|operatorname{Aut}(H)|}cdotfrac{e_H}{binom n2}$$ where $v_H=|V(H)|$ and $e_H=|E(H)|$?
    – bof
    Nov 19 '18 at 12:28
















1












1








1







Given a graph $H$. For a fixed edge $e$ in a complete graph $K_n$, how many copies of $H$ containing $e$ in $K_n$? Assume $n$ is large enough?



I am wondering if $n^{v_H-2}$ is an upper bound? Since an upper bound I can come up with is $binom{n-2}{v_H-2}v_H!$. But it seems larger than $n^{v_H-2}$ when $v_Hge 3$ and $n$ large enough.










share|cite|improve this question













Given a graph $H$. For a fixed edge $e$ in a complete graph $K_n$, how many copies of $H$ containing $e$ in $K_n$? Assume $n$ is large enough?



I am wondering if $n^{v_H-2}$ is an upper bound? Since an upper bound I can come up with is $binom{n-2}{v_H-2}v_H!$. But it seems larger than $n^{v_H-2}$ when $v_Hge 3$ and $n$ large enough.







combinatorics graph-theory






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 19 '18 at 3:17









Connor

865513




865513












  • Isn't it exactly $$binom n{v_H}cdotfrac{v_H!}{|operatorname{Aut}(H)|}cdotfrac{e_H}{binom n2}$$ where $v_H=|V(H)|$ and $e_H=|E(H)|$?
    – bof
    Nov 19 '18 at 12:28




















  • Isn't it exactly $$binom n{v_H}cdotfrac{v_H!}{|operatorname{Aut}(H)|}cdotfrac{e_H}{binom n2}$$ where $v_H=|V(H)|$ and $e_H=|E(H)|$?
    – bof
    Nov 19 '18 at 12:28


















Isn't it exactly $$binom n{v_H}cdotfrac{v_H!}{|operatorname{Aut}(H)|}cdotfrac{e_H}{binom n2}$$ where $v_H=|V(H)|$ and $e_H=|E(H)|$?
– bof
Nov 19 '18 at 12:28






Isn't it exactly $$binom n{v_H}cdotfrac{v_H!}{|operatorname{Aut}(H)|}cdotfrac{e_H}{binom n2}$$ where $v_H=|V(H)|$ and $e_H=|E(H)|$?
– bof
Nov 19 '18 at 12:28

















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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3004474%2fhow-many-copies-of-a-graph-h-containing-a-fixed-edge-in-n%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































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.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • 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.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3004474%2fhow-many-copies-of-a-graph-h-containing-a-fixed-edge-in-n%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

AnyDesk - Fatal Program Failure

How to calibrate 16:9 built-in touch-screen to a 4:3 resolution?

QoS: MAC-Priority for clients behind a repeater