Dominating sets in tournaments; is $2^{n+1}-2$ tight?












6












$begingroup$


A tournement is a directed graph such that for every pair of distinct vertices ${x,y}$, there is either an edge from $x$ to $y$ or from $y$ to $x$, but not both. I will use "$xto y$" to mean "there is an edge from $x$ to $y$."



A dominating set of a directed graph is a subset $S$ of vertices such that for every $tnotin S$, there exists $sin S$ so $sto t$.



It can be shown$^*$ that every tournament on $2^{n+1}-2$ vertices has a dominating set of size $n$. My question is whether this result is tight.




Does there exist a tournament on $2^{n+1}-1$ vertices with no dominating set of size $n$?



If not, what is the smallest tournament with no dominating set of size $n$?




My thoughts:




  • A necessary condition for a graph on $2^{n+1}-1$ vertices with no dominating set of size $n$ is that every vertex must have an out-degree of exactly $2^n-1$, so exactly half of its edges are outgoing.



  • The answer is yes when $n=1,2$.




    • The "rock-paper-scissors" graph on three vertices has no dominating set of size $1$.

    • The graph on $mathbb Z/7mathbb Z$ where each $x$ has directed edges to $x+1,x+2$ and $x+4pmod7$ has no dominating set of size $2$.




For $nge 3$, the possibilities get too large, and I cannot come up with a clever solution. Can anyone see a pattern?



I came up with this problem while thinking about this puzzle.




$^*$Consider a vertex $s$ with maximal out-degree. By the hand-shaking lemma, this degree must be at least $(2^{n+1}-3)/2$, so at least $2^n-1$. Include $s$ in $S$, then ignore $s$ and the vertices $t$ for which $sto t$. What remains is tournament of size $(2^{n+1}-2)-1-(2^{n}-1)=2^n-2$. Proceed by induction.






combinatorics discrete-mathematics graph-theory directed-graphs extremal-graph-theory







share|cite|improve this question











$endgroup$

















    6












    $begingroup$


    A tournement is a directed graph such that for every pair of distinct vertices ${x,y}$, there is either an edge from $x$ to $y$ or from $y$ to $x$, but not both. I will use "$xto y$" to mean "there is an edge from $x$ to $y$."



    A dominating set of a directed graph is a subset $S$ of vertices such that for every $tnotin S$, there exists $sin S$ so $sto t$.



    It can be shown$^*$ that every tournament on $2^{n+1}-2$ vertices has a dominating set of size $n$. My question is whether this result is tight.




    Does there exist a tournament on $2^{n+1}-1$ vertices with no dominating set of size $n$?



    If not, what is the smallest tournament with no dominating set of size $n$?




    My thoughts:




    • A necessary condition for a graph on $2^{n+1}-1$ vertices with no dominating set of size $n$ is that every vertex must have an out-degree of exactly $2^n-1$, so exactly half of its edges are outgoing.



    • The answer is yes when $n=1,2$.




      • The "rock-paper-scissors" graph on three vertices has no dominating set of size $1$.

      • The graph on $mathbb Z/7mathbb Z$ where each $x$ has directed edges to $x+1,x+2$ and $x+4pmod7$ has no dominating set of size $2$.




    For $nge 3$, the possibilities get too large, and I cannot come up with a clever solution. Can anyone see a pattern?



    I came up with this problem while thinking about this puzzle.




    $^*$Consider a vertex $s$ with maximal out-degree. By the hand-shaking lemma, this degree must be at least $(2^{n+1}-3)/2$, so at least $2^n-1$. Include $s$ in $S$, then ignore $s$ and the vertices $t$ for which $sto t$. What remains is tournament of size $(2^{n+1}-2)-1-(2^{n}-1)=2^n-2$. Proceed by induction.






    combinatorics discrete-mathematics graph-theory directed-graphs extremal-graph-theory







    share|cite|improve this question











    $endgroup$















      6












      6








      6


      3



      $begingroup$


      A tournement is a directed graph such that for every pair of distinct vertices ${x,y}$, there is either an edge from $x$ to $y$ or from $y$ to $x$, but not both. I will use "$xto y$" to mean "there is an edge from $x$ to $y$."



      A dominating set of a directed graph is a subset $S$ of vertices such that for every $tnotin S$, there exists $sin S$ so $sto t$.



      It can be shown$^*$ that every tournament on $2^{n+1}-2$ vertices has a dominating set of size $n$. My question is whether this result is tight.




      Does there exist a tournament on $2^{n+1}-1$ vertices with no dominating set of size $n$?



      If not, what is the smallest tournament with no dominating set of size $n$?




      My thoughts:




      • A necessary condition for a graph on $2^{n+1}-1$ vertices with no dominating set of size $n$ is that every vertex must have an out-degree of exactly $2^n-1$, so exactly half of its edges are outgoing.



      • The answer is yes when $n=1,2$.




        • The "rock-paper-scissors" graph on three vertices has no dominating set of size $1$.

        • The graph on $mathbb Z/7mathbb Z$ where each $x$ has directed edges to $x+1,x+2$ and $x+4pmod7$ has no dominating set of size $2$.




      For $nge 3$, the possibilities get too large, and I cannot come up with a clever solution. Can anyone see a pattern?



      I came up with this problem while thinking about this puzzle.




      $^*$Consider a vertex $s$ with maximal out-degree. By the hand-shaking lemma, this degree must be at least $(2^{n+1}-3)/2$, so at least $2^n-1$. Include $s$ in $S$, then ignore $s$ and the vertices $t$ for which $sto t$. What remains is tournament of size $(2^{n+1}-2)-1-(2^{n}-1)=2^n-2$. Proceed by induction.






      combinatorics discrete-mathematics graph-theory directed-graphs extremal-graph-theory







      share|cite|improve this question











      $endgroup$




      A tournement is a directed graph such that for every pair of distinct vertices ${x,y}$, there is either an edge from $x$ to $y$ or from $y$ to $x$, but not both. I will use "$xto y$" to mean "there is an edge from $x$ to $y$."



      A dominating set of a directed graph is a subset $S$ of vertices such that for every $tnotin S$, there exists $sin S$ so $sto t$.



      It can be shown$^*$ that every tournament on $2^{n+1}-2$ vertices has a dominating set of size $n$. My question is whether this result is tight.




      Does there exist a tournament on $2^{n+1}-1$ vertices with no dominating set of size $n$?



      If not, what is the smallest tournament with no dominating set of size $n$?




      My thoughts:




      • A necessary condition for a graph on $2^{n+1}-1$ vertices with no dominating set of size $n$ is that every vertex must have an out-degree of exactly $2^n-1$, so exactly half of its edges are outgoing.



      • The answer is yes when $n=1,2$.




        • The "rock-paper-scissors" graph on three vertices has no dominating set of size $1$.

        • The graph on $mathbb Z/7mathbb Z$ where each $x$ has directed edges to $x+1,x+2$ and $x+4pmod7$ has no dominating set of size $2$.




      For $nge 3$, the possibilities get too large, and I cannot come up with a clever solution. Can anyone see a pattern?



      I came up with this problem while thinking about this puzzle.




      $^*$Consider a vertex $s$ with maximal out-degree. By the hand-shaking lemma, this degree must be at least $(2^{n+1}-3)/2$, so at least $2^n-1$. Include $s$ in $S$, then ignore $s$ and the vertices $t$ for which $sto t$. What remains is tournament of size $(2^{n+1}-2)-1-(2^{n}-1)=2^n-2$. Proceed by induction.






      combinatorics discrete-mathematics graph-theory directed-graphs extremal-graph-theory




      combinatorics discrete-mathematics graph-theory directed-graphs extremal-graph-theory






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Jan 8 at 23:00







      Mike Earnest

















      asked Jan 8 at 22:06









      Mike EarnestMike Earnest

      21.2k11951




      21.2k11951






















          1 Answer
          1






          active

          oldest

          votes


















          2












          $begingroup$

          The answer to your question is yes: if $f(n)$ is the least number of vertices in a tournament with no $n$-vertex dominating set, then $f(n) > 2^{n+1}-1$ for large $n$ and in general we know
          $$
          (n+2) 2^{n-1} - 1 le f(n) le C cdot n^2 cdot 2^n
          $$
          for some constant $C$. Already for $n=3$ there is a $19$-vertex tournament with no dominating set of size $3$: the quadratic residue tournament mod $19$. (Here, we have an edge from $i$ to $j$ if there is some $k$ such that $i + k^2 equiv j pmod{19}$; it is a generalization of your $7$-vertex construction.)



          (For more details, see for example this paper by Szekeres and Szekeres.)






          share|cite|improve this answer









          $endgroup$













            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%2f3066793%2fdominating-sets-in-tournaments-is-2n1-2-tight%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown

























            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            2












            $begingroup$

            The answer to your question is yes: if $f(n)$ is the least number of vertices in a tournament with no $n$-vertex dominating set, then $f(n) > 2^{n+1}-1$ for large $n$ and in general we know
            $$
            (n+2) 2^{n-1} - 1 le f(n) le C cdot n^2 cdot 2^n
            $$
            for some constant $C$. Already for $n=3$ there is a $19$-vertex tournament with no dominating set of size $3$: the quadratic residue tournament mod $19$. (Here, we have an edge from $i$ to $j$ if there is some $k$ such that $i + k^2 equiv j pmod{19}$; it is a generalization of your $7$-vertex construction.)



            (For more details, see for example this paper by Szekeres and Szekeres.)






            share|cite|improve this answer









            $endgroup$


















              2












              $begingroup$

              The answer to your question is yes: if $f(n)$ is the least number of vertices in a tournament with no $n$-vertex dominating set, then $f(n) > 2^{n+1}-1$ for large $n$ and in general we know
              $$
              (n+2) 2^{n-1} - 1 le f(n) le C cdot n^2 cdot 2^n
              $$
              for some constant $C$. Already for $n=3$ there is a $19$-vertex tournament with no dominating set of size $3$: the quadratic residue tournament mod $19$. (Here, we have an edge from $i$ to $j$ if there is some $k$ such that $i + k^2 equiv j pmod{19}$; it is a generalization of your $7$-vertex construction.)



              (For more details, see for example this paper by Szekeres and Szekeres.)






              share|cite|improve this answer









              $endgroup$
















                2












                2








                2





                $begingroup$

                The answer to your question is yes: if $f(n)$ is the least number of vertices in a tournament with no $n$-vertex dominating set, then $f(n) > 2^{n+1}-1$ for large $n$ and in general we know
                $$
                (n+2) 2^{n-1} - 1 le f(n) le C cdot n^2 cdot 2^n
                $$
                for some constant $C$. Already for $n=3$ there is a $19$-vertex tournament with no dominating set of size $3$: the quadratic residue tournament mod $19$. (Here, we have an edge from $i$ to $j$ if there is some $k$ such that $i + k^2 equiv j pmod{19}$; it is a generalization of your $7$-vertex construction.)



                (For more details, see for example this paper by Szekeres and Szekeres.)






                share|cite|improve this answer









                $endgroup$



                The answer to your question is yes: if $f(n)$ is the least number of vertices in a tournament with no $n$-vertex dominating set, then $f(n) > 2^{n+1}-1$ for large $n$ and in general we know
                $$
                (n+2) 2^{n-1} - 1 le f(n) le C cdot n^2 cdot 2^n
                $$
                for some constant $C$. Already for $n=3$ there is a $19$-vertex tournament with no dominating set of size $3$: the quadratic residue tournament mod $19$. (Here, we have an edge from $i$ to $j$ if there is some $k$ such that $i + k^2 equiv j pmod{19}$; it is a generalization of your $7$-vertex construction.)



                (For more details, see for example this paper by Szekeres and Szekeres.)







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Jan 8 at 23:37









                Misha LavrovMisha Lavrov

                44.8k556107




                44.8k556107






























                    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.




                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function () {
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3066793%2fdominating-sets-in-tournaments-is-2n1-2-tight%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

                    Mario Kart Wii

                    Image
                    Please consider supporting The Cutting Room Floor on Patreon. Thanks for all your support! Mario Kart Wii From The Cutting Room Floor Jump to: navigation, search Mario Kart Wii Developer : Nintendo Publisher : Nintendo Platform : Wii Released in JP : April 10, 2008 Released in US : April 27, 2008 Released in EU : April 11, 2008 Released in AU : April 24, 2008 Released in KR : April 30, 2009 This game has unused animations. This game has unused areas. This game has unused code. This game has unused objects. This game has unused modes / minigames. This game has unused graphics. This game has unused models. This game has unused items. This game has unused music. This game has regional differences. This game has a notes page This game has a prerelease article Mario Kart Wii is the sixth game in the series (not counting Arcade editions), which intro...
                    Read more

                    The Binding of Isaac: Rebirth/Afterbirth

                    Image
                    Please consider supporting The Cutting Room Floor on Patreon. Thanks for all your support! The Binding of Isaac: Rebirth/Afterbirth From The Cutting Room Floor < The Binding of Isaac: Rebirth Jump to: navigation, search This is a sub-page of The Binding of Isaac: Rebirth . Afterbirth is the first expansion pack for Rebirth and features a variety of improvements. Contents 1 Unused Graphics 1.1 Old Man Keeper 1.2 Skinless Hush 1.3 Miscellaneous Unused Hush Sprites 1.4 Generosity achievement 1.5 Afterbirth+ Room Editor 1.6 Bearded Ultra Greed 1.7 Early Ultra Greed 1.8 Unused Brownie Expression 1.9 Frail's Spinning Head 1.10 Mom's Dead Hand Alt 2 Unused Audio 2.1 Unused Dead Womb Layer 2.2 Unused Hush Battle Outro 2.3 The Stain Grunt Unused Graphics Old Man Keeper Image file: gfxuimain me...
                    Read more

                    What does “Dominus providebit” mean?

                    Image
                    5 Does "Dominus providebit" mean "The Lord will provide" or "The Lord provides"? I once had a bit of an argument with a guy who studied Latin over that. It's an inscription that appears on the rim of some old Swiss coins that I have. meaning latin-to-english-translation grammar-identification share | improve this question edited Jan 18 at 15:27 V2Blast 105 4 asked Jan 17 at 22:49 Donald K. Donald K. 26 1 ...
                    Read more