Dudek

Results: 857



#Item
61COPS AND ROBBERS PLAYING ON EDGES ANDRZEJ DUDEK, PRZEMYSLAW GORDINOWICZ, AND PAWEL PRALAT Abstract. In the game of cops and robber, the cops try to capture a robber moving on the vertices of the graph. The minimum number

COPS AND ROBBERS PLAYING ON EDGES ANDRZEJ DUDEK, PRZEMYSLAW GORDINOWICZ, AND PAWEL PRALAT Abstract. In the game of cops and robber, the cops try to capture a robber moving on the vertices of the graph. The minimum number

Add to Reading List

Source URL: homepages.wmich.edu

Language: English - Date: 2014-01-20 20:52:13
    62Rainbow Hamilton cycles in uniform hypergraphs Andrzej Dudek Alan Frieze∗ Department of Mathematics

    Rainbow Hamilton cycles in uniform hypergraphs Andrzej Dudek Alan Frieze∗ Department of Mathematics

    Add to Reading List

    Source URL: homepages.wmich.edu

    Language: English - Date: 2012-03-14 17:13:11
      63Planar Ramsey Numbers for Small Graphs Andrzej Dudek Department of Mathematics and Computer Science Emory University Atlanta, GA 30322, USA Andrzej Ruci´

      Planar Ramsey Numbers for Small Graphs Andrzej Dudek Department of Mathematics and Computer Science Emory University Atlanta, GA 30322, USA Andrzej Ruci´

      Add to Reading List

      Source URL: homepages.wmich.edu

      Language: English - Date: 2011-10-27 21:19:40
        64Extensions of results on rainbow Hamilton cycles in uniform hypergraphs Andrzej Dudek∗ Michael Ferrara†

        Extensions of results on rainbow Hamilton cycles in uniform hypergraphs Andrzej Dudek∗ Michael Ferrara†

        Add to Reading List

        Source URL: homepages.wmich.edu

        Language: English - Date: 2012-10-09 02:23:41
          65ON SOME MULTICOLOUR RAMSEY PROPERTIES OF RANDOM GRAPHS ANDRZEJ DUDEK AND PAWEL PRALAT ˆ ) of a graph F is the smallest integer m such Abstract. The size-Ramsey number R(F that there exists a graph G on m edges with the

          ON SOME MULTICOLOUR RAMSEY PROPERTIES OF RANDOM GRAPHS ANDRZEJ DUDEK AND PAWEL PRALAT ˆ ) of a graph F is the smallest integer m such Abstract. The size-Ramsey number R(F that there exists a graph G on m edges with the

          Add to Reading List

          Source URL: homepages.wmich.edu

          Language: English - Date: 2016-01-11 14:31:39
            66Maker-Breaker games on random geometric graphs Andrew Beveridge∗, Andrzej Dudek† , Alan Frieze‡, Tobias M¨ uller§, Miloˇs Stojakovi´c¶ July 25, 2014 Abstract

            Maker-Breaker games on random geometric graphs Andrew Beveridge∗, Andrzej Dudek† , Alan Frieze‡, Tobias M¨ uller§, Miloˇs Stojakovi´c¶ July 25, 2014 Abstract

            Add to Reading List

            Source URL: homepages.wmich.edu

            Language: English - Date: 2014-07-25 19:46:36
              67Tight Hamilton Cycles in Random Uniform Hypergraphs Andrzej Dudek∗ Alan Frieze† ‡ June 28, 2011

              Tight Hamilton Cycles in Random Uniform Hypergraphs Andrzej Dudek∗ Alan Frieze† ‡ June 28, 2011

              Add to Reading List

              Source URL: homepages.wmich.edu

              Language: English - Date: 2011-08-25 00:46:35
                68On Minimum Saturated Matrices Andrzej Dudek∗ Oleg Pikhurko†‡§ Andrew Thomason¶

                On Minimum Saturated Matrices Andrzej Dudek∗ Oleg Pikhurko†‡§ Andrew Thomason¶

                Add to Reading List

                Source URL: homepages.wmich.edu

                Language: English - Date: 2012-05-24 02:09:17
                  69RICK SCOTT GOVERNOR ELIZABETH DUDEK SECRETARY Agency for Health Care Administration

                  RICK SCOTT GOVERNOR ELIZABETH DUDEK SECRETARY Agency for Health Care Administration

                  Add to Reading List

                  Source URL: www.ahca.myflorida.com

                  Language: English - Date: 2016-04-05 12:53:45
                    70ON THE NUMBER OF ALTERNATING PATHS IN BIPARTITE COMPLETE GRAPHS PATRICK BENNETT, ANDRZEJ DUDEK, ELLIOT LAFORGE March 15, 2016 Abstract. Let C ⊆ [r]m be a code such that any two words of C have Hamming distance at least

                    ON THE NUMBER OF ALTERNATING PATHS IN BIPARTITE COMPLETE GRAPHS PATRICK BENNETT, ANDRZEJ DUDEK, ELLIOT LAFORGE March 15, 2016 Abstract. Let C ⊆ [r]m be a code such that any two words of C have Hamming distance at least

                    Add to Reading List

                    Source URL: homepages.wmich.edu

                    Language: English - Date: 2016-03-15 19:27:05