Combinatorial proof of Hamiltonian paths on the rook graphNumber of duplicate cases in graphs - hamiltonian...

Can a wizard cast a spell during their first turn of combat if they initiated combat by releasing a readied spell?

Should I be concerned about student access to a test bank?

Relation between independence and correlation of uniform random variables

What does Deadpool mean by "left the house in that shirt"?

Can other pieces capture a threatening piece and prevent a checkmate?

Hausdorff dimension of the boundary of fibres of Lipschitz maps

What can I do if I am asked to learn different programming languages very frequently?

Loading the leaflet Map in Lightning Web Component

Deletion of copy-ctor & copy-assignment - public, private or protected?

How do hiring committees for research positions view getting "scooped"?

Are dual Irish/British citizens bound by the 90/180 day rule when travelling in the EU after Brexit?

Is there a term for accumulated dirt on the outside of your hands and feet?

Have the tides ever turned twice on any open problem?

PTIJ What is the inyan of the Konami code in Uncle Moishy's song?

Practical application of matrices and determinants

Is it possible to stack the damage done by the Absorb Elements spell?

Pronounciation of the combination "st" in spanish accents

How could an airship be repaired midflight?

Knife as defense against stray dogs

Light propagating through a sound wave

gerund and noun applications

What are substitutions for coconut in curry?

Could Sinn Fein swing any Brexit vote in Parliament?

Is it true that good novels will automatically sell themselves on Amazon (and so on) and there is no need for one to waste time promoting?



Combinatorial proof of Hamiltonian paths on the rook graph


Number of duplicate cases in graphs - hamiltonian and nonhamiltonian pathsCan more than one hamiltonian graph have the same set of hamiltonian paths?Hamiltonian paths in cubic graphRook tour on the chess boardMinimum number of Hamiltonian paths in a strongly connected tournament on $n$ nodesProve that the line graph of a Hamiltonian simple graph is Hamiltonian.Hamiltonian paths in a simple graphHamiltonian cycles and paths in a graphHamiltonian paths in graphHamiltonian paths and cycles of rook graph on $ntimes2$ chessboard













1












$begingroup$


We can be sure that number of Hamiltonian paths on the rook graph for any single cell on $ntimes2$ chessboard equals
$$
H(n+1) = sum_{k=0}^{n}
binom{n}{k}
binom{k}{lfloor{frac{k}{2}rfloor}}
left(n-lfloor{frac{k}{2}rfloor}right)!
left(n-lfloor{frac{k+1}{2}rfloor}right)!$$

Is there a combinatorial proof for it?










share|cite|improve this question











$endgroup$

















    1












    $begingroup$


    We can be sure that number of Hamiltonian paths on the rook graph for any single cell on $ntimes2$ chessboard equals
    $$
    H(n+1) = sum_{k=0}^{n}
    binom{n}{k}
    binom{k}{lfloor{frac{k}{2}rfloor}}
    left(n-lfloor{frac{k}{2}rfloor}right)!
    left(n-lfloor{frac{k+1}{2}rfloor}right)!$$

    Is there a combinatorial proof for it?










    share|cite|improve this question











    $endgroup$















      1












      1








      1





      $begingroup$


      We can be sure that number of Hamiltonian paths on the rook graph for any single cell on $ntimes2$ chessboard equals
      $$
      H(n+1) = sum_{k=0}^{n}
      binom{n}{k}
      binom{k}{lfloor{frac{k}{2}rfloor}}
      left(n-lfloor{frac{k}{2}rfloor}right)!
      left(n-lfloor{frac{k+1}{2}rfloor}right)!$$

      Is there a combinatorial proof for it?










      share|cite|improve this question











      $endgroup$




      We can be sure that number of Hamiltonian paths on the rook graph for any single cell on $ntimes2$ chessboard equals
      $$
      H(n+1) = sum_{k=0}^{n}
      binom{n}{k}
      binom{k}{lfloor{frac{k}{2}rfloor}}
      left(n-lfloor{frac{k}{2}rfloor}right)!
      left(n-lfloor{frac{k+1}{2}rfloor}right)!$$

      Is there a combinatorial proof for it?







      graph-theory hamiltonian-path combinatorial-proofs chessboard






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Mar 11 at 19:52









      gt6989b

      34.9k22557




      34.9k22557










      asked Mar 11 at 19:48









      user514787user514787

      749310




      749310






















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


          }
          });














          draft saved

          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3144138%2fcombinatorial-proof-of-hamiltonian-paths-on-the-rook-graph%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
















          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%2f3144138%2fcombinatorial-proof-of-hamiltonian-paths-on-the-rook-graph%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

          Nidaros erkebispedøme

          Birsay

          Where did Arya get these scars? Unicorn Meta Zoo #1: Why another podcast? Announcing the arrival of Valued Associate #679: Cesar Manara Favourite questions and answers from the 1st quarter of 2019Why did Arya refuse to end it?Has the pronunciation of Arya Stark's name changed?Has Arya forgiven people?Why did Arya Stark lose her vision?Why can Arya still use the faces?Has the Narrow Sea become narrower?Does Arya Stark know how to make poisons outside of the House of Black and White?Why did Nymeria leave Arya?Why did Arya not kill the Lannister soldiers she encountered in the Riverlands?What is the current canonical age of Sansa, Bran and Arya Stark?