For an $n$-tournament, what's a tight upper bound for the minimum number of transitive sub tournaments needed to edge cover it?Score Sequences Of Tournaments And IsomorphismStrong tournaments, degree sequences, isomorphismNumber of simple edge-disjoint paths needed to cover a planar graphgraph theory: upper bound on edge number, given number of vertices andestimate the upper bound for the number of the nodes of length $l$Minimum number of transitive paths in tournamentUpper bound for the number of graphs up to isomorphismMinimum number of edge-disjoint paths needed to cover a graphFind the best upper bound on number of edges for a planar graph with a minimum girth of a specified numberFor all $ngeq3$ does there always exist an $n$ vertex tournament without induced acyclic subgraphs of size $4$ or more?
How could indestructible materials be used in power generation?
If human space travel is limited by the G force vulnerability, is there a way to counter G forces?
Cronab fails because shell path not found
Withdrawals from HSA
Why can't we play rap on piano?
Twin primes whose sum is a cube
Did Shadowfax go to Valinor?
Anagram holiday
Were any external disk drives stacked vertically?
Is it possible to download Internet Explorer on my Mac running OS X El Capitan?
Is "remove commented out code" correct English?
How can I prevent hyper evolved versions of regular creatures from wiping out their cousins?
How do I write bicross product symbols in latex?
What exploit are these user agents trying to use?
Can a virus destroy the BIOS of a modern computer?
Is it unprofessional to ask if a job posting on GlassDoor is real?
What does it mean to describe someone as a butt steak?
Can I ask the recruiters in my resume to put the reason why I am rejected?
What's the point of deactivating Num Lock on login screens?
Do I have a twin with permutated remainders?
Why does Kotter return in Welcome Back Kotter
How much of data wrangling is a data scientist's job?
Is it legal for company to use my work email to pretend I still work there?
How can I tell someone that I want to be his or her friend?
For an $n$-tournament, what's a tight upper bound for the minimum number of transitive sub tournaments needed to edge cover it?
Score Sequences Of Tournaments And IsomorphismStrong tournaments, degree sequences, isomorphismNumber of simple edge-disjoint paths needed to cover a planar graphgraph theory: upper bound on edge number, given number of vertices andestimate the upper bound for the number of the nodes of length $l$Minimum number of transitive paths in tournamentUpper bound for the number of graphs up to isomorphismMinimum number of edge-disjoint paths needed to cover a graphFind the best upper bound on number of edges for a planar graph with a minimum girth of a specified numberFor all $ngeq3$ does there always exist an $n$ vertex tournament without induced acyclic subgraphs of size $4$ or more?
$begingroup$
Given an $n$-tournament, is there a known tight upper bound for the minimum number of transitive sub tournaments needed to edge cover the original tournament?
Context:
Studying causal graphs in relativistic quantum information
graph-theory
asked Mar 29 at 1:14
cplusplusgurucplusplusguru
172
$endgroup$
add a comment |
$begingroup$
Given an $n$-tournament, is there a known tight upper bound for the minimum number of transitive sub tournaments needed to edge cover the original tournament?
Context:
Studying causal graphs in relativistic quantum information
graph-theory
asked Mar 29 at 1:14
cplusplusgurucplusplusguru
172
$endgroup$
add a comment |
$begingroup$
Given an $n$-tournament, is there a known tight upper bound for the minimum number of transitive sub tournaments needed to edge cover the original tournament?
Context:
Studying causal graphs in relativistic quantum information
graph-theory
asked Mar 29 at 1:14
cplusplusgurucplusplusguru
172
$endgroup$
Given an $n$-tournament, is there a known tight upper bound for the minimum number of transitive sub tournaments needed to edge cover the original tournament?
Context:
Studying causal graphs in relativistic quantum information
graph-theory
graph-theory
asked Mar 29 at 1:14
cplusplusgurucplusplusguru
172
asked Mar 29 at 1:14
cplusplusgurucplusplusguru
172
asked Mar 29 at 1:14
cplusplusgurucplusplusguru
172
asked Mar 29 at 1:14
cplusplusgurucplusplusguru
172
asked Mar 29 at 1:14
cplusplusgurucplusplusguru
172
172
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%2f3166612%2ffor-an-n-tournament-whats-a-tight-upper-bound-for-the-minimum-number-of-tran%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%2f3166612%2ffor-an-n-tournament-whats-a-tight-upper-bound-for-the-minimum-number-of-tran%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
