<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF
 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
 xmlns="http://purl.org/rss/1.0/"
 xmlns:cc="http://web.resource.org/cc/"
 xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/"
 xmlns:dc="http://purl.org/dc/elements/1.1/"
 xmlns:syn="http://purl.org/rss/1.0/modules/syndication/"
 xmlns:content="http://purl.org/rss/1.0/modules/content/"
 xmlns:admin="http://webns.net/mvcb/"
>

<channel rdf:about="http://www.bibsonomy.org/author/Keevash">
  <title>BibSonomy publications for /author/Keevash</title>
  <link>http://www.bibsonomy.org/author/Keevash</link>
  <description>BibSonomy RSS Feed for /author/Keevash</description>

  <items>
    <rdf:Seq>
      <rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2bbbe7ae6e1765a53ee96367ac380bad3/dblp"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/255ab2cd54056bd288dfe970f8d92a8b8/dblp"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2f1db712aa3c4d4800516ba99fb02fa4c/dblp"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2110f6d8911179e899e4cf7ef7f24b6b2/dblp"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/25f626b19aa24a9bd0440bc8affe6b68b/dblp"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2f3858466d02837c2e9e77227b2a1bc3d/smicha"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/20a4bfc2d90abc8e4b970642dd7cb96f1/dblp"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2d80de2492a12a6efe568349c356a0b8b/dblp"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2fecbccae5c398875e06b6059cc077fb0/dblp"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/20d6f44a60d1ecf6ef5065de62f785868/dblp"/>
      </rdf:Seq>
  </items>
</channel>

<item rdf:about="http://www.bibsonomy.org/bibtex/2bbbe7ae6e1765a53ee96367ac380bad3/dblp">
    <title>Rainbow Tur&#225;n Problems.</title>
    <description>dblp</description>
    <link>http://www.bibsonomy.org/bibtex/2bbbe7ae6e1765a53ee96367ac380bad3/dblp</link>
    <dc:creator>dblp</dc:creator>
    <dc:date>2008-11-20T00:00:00+01:00</dc:date>
    <dc:subject>
      dblp </dc:subject>
    <content:encoded><![CDATA[
    <link rel="stylesheet" href="http://www.bibsonomy.org/resources/css/rss.css" type="text/css"/>
    <div class="block">
      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/2bbbe7ae6e1765a53ee96367ac380bad3/dblp">Rainbow Tur&#225;n Problems.</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Peter <a href="http://www.bibsonomy.org/author/Keevash">Keevash</a>         	     	 
        	  and Dhruv <a href="http://www.bibsonomy.org/author/Mubayi">Mubayi</a>         	     	 
        	  and Benny <a href="http://www.bibsonomy.org/author/Sudakov">Sudakov</a>         	     	 
        	  and Jacques <a href="http://www.bibsonomy.org/author/Verstra%C3%ABte">Verstraëte</a>         	     	 
        	 </span> 
  <em>Combinatorics, Probability &amp; Computing</em>
      <b>16</b>
      109-126
  (2007)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/dblp/dblp">dblp</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/dblp">dblp</a> 
        
        
        on 2008-11-20 00:00:00 </span></div>
    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp" />
        </rdf:Bag>
    </taxo:topics>
  </item>
<item rdf:about="http://www.bibsonomy.org/bibtex/255ab2cd54056bd288dfe970f8d92a8b8/dblp">
    <title>A hypergraph regularity method for generalized Tur&#225;n problems.</title>
    <description>dblp</description>
    <link>http://www.bibsonomy.org/bibtex/255ab2cd54056bd288dfe970f8d92a8b8/dblp</link>
    <dc:creator>dblp</dc:creator>
    <dc:date>2008-11-19T00:00:00+01:00</dc:date>
    <dc:subject>
      dblp </dc:subject>
    <content:encoded><![CDATA[
    <link rel="stylesheet" href="http://www.bibsonomy.org/resources/css/rss.css" type="text/css"/>
    <div class="block">
      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/255ab2cd54056bd288dfe970f8d92a8b8/dblp">A hypergraph regularity method for generalized Tur&#225;n problems.</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Peter <a href="http://www.bibsonomy.org/author/Keevash">Keevash</a>         	     	 
        	 </span> 
  <em>Random Struct. Algorithms</em>
      <b>34</b>
      123-164
  (2009)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/dblp/dblp">dblp</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/dblp">dblp</a> 
        
        
        on 2008-11-19 00:00:00 </span></div>
    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp" />
        </rdf:Bag>
    </taxo:topics>
  </item>
<item rdf:about="http://www.bibsonomy.org/bibtex/2f1db712aa3c4d4800516ba99fb02fa4c/dblp">
    <title>Set Systems with No Singleton Intersection.</title>
    <description>dblp</description>
    <link>http://www.bibsonomy.org/bibtex/2f1db712aa3c4d4800516ba99fb02fa4c/dblp</link>
    <dc:creator>dblp</dc:creator>
    <dc:date>2008-06-20T00:00:00+02:00</dc:date>
    <dc:subject>
      dblp </dc:subject>
    <content:encoded><![CDATA[
    <link rel="stylesheet" href="http://www.bibsonomy.org/resources/css/rss.css" type="text/css"/>
    <div class="block">
      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/2f1db712aa3c4d4800516ba99fb02fa4c/dblp">Set Systems with No Singleton Intersection.</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Peter <a href="http://www.bibsonomy.org/author/Keevash">Keevash</a>         	     	 
        	  and Dhruv <a href="http://www.bibsonomy.org/author/Mubayi">Mubayi</a>         	     	 
        	  and Richard M. <a href="http://www.bibsonomy.org/author/Wilson">Wilson</a>         	     	 
        	 </span> 
  <em>SIAM J. Discrete Math.</em>
      <b>20</b>
      1031-1041
  (2006)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/dblp/dblp">dblp</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/dblp">dblp</a> 
        
        
        on 2008-06-20 00:00:00 </span></div>
    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp" />
        </rdf:Bag>
    </taxo:topics>
  </item>
<item rdf:about="http://www.bibsonomy.org/bibtex/2110f6d8911179e899e4cf7ef7f24b6b2/dblp">
    <title>Bounding the Number of Edges in Permutation Graphs.</title>
    <description>dblp</description>
    <link>http://www.bibsonomy.org/bibtex/2110f6d8911179e899e4cf7ef7f24b6b2/dblp</link>
    <dc:creator>dblp</dc:creator>
    <dc:date>2008-05-25T00:00:00+02:00</dc:date>
    <dc:subject>
      dblp </dc:subject>
    <content:encoded><![CDATA[
    <link rel="stylesheet" href="http://www.bibsonomy.org/resources/css/rss.css" type="text/css"/>
    <div class="block">
      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/2110f6d8911179e899e4cf7ef7f24b6b2/dblp">Bounding the Number of Edges in Permutation Graphs.</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Peter <a href="http://www.bibsonomy.org/author/Keevash">Keevash</a>         	     	 
        	  and Po-Shen <a href="http://www.bibsonomy.org/author/Loh">Loh</a>         	     	 
        	  and Benny <a href="http://www.bibsonomy.org/author/Sudakov">Sudakov</a>         	     	 
        	 </span> 
  <em>Electr. J. Comb.</em>
      <b>13</b>
      
  (2006)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/dblp/dblp">dblp</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/dblp">dblp</a> 
        
        
        on 2008-05-25 00:00:00 </span></div>
    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp" />
        </rdf:Bag>
    </taxo:topics>
  </item>
<item rdf:about="http://www.bibsonomy.org/bibtex/25f626b19aa24a9bd0440bc8affe6b68b/dblp">
    <title>The Tur&#225;n Problem for Hypergraphs of Fixed Size.</title>
    <description>dblp</description>
    <link>http://www.bibsonomy.org/bibtex/25f626b19aa24a9bd0440bc8affe6b68b/dblp</link>
    <dc:creator>dblp</dc:creator>
    <dc:date>2008-05-25T00:00:00+02:00</dc:date>
    <dc:subject>
      dblp </dc:subject>
    <content:encoded><![CDATA[
    <link rel="stylesheet" href="http://www.bibsonomy.org/resources/css/rss.css" type="text/css"/>
    <div class="block">
      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/25f626b19aa24a9bd0440bc8affe6b68b/dblp">The Tur&#225;n Problem for Hypergraphs of Fixed Size.</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Peter <a href="http://www.bibsonomy.org/author/Keevash">Keevash</a>         	     	 
        	 </span> 
  <em>Electr. J. Comb.</em>
      <b>12</b>
      
  (2005)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/dblp/dblp">dblp</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/dblp">dblp</a> 
        
        
        on 2008-05-25 00:00:00 </span></div>
    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp" />
        </rdf:Bag>
    </taxo:topics>
  </item>
<item rdf:about="http://www.bibsonomy.org/bibtex/2f3858466d02837c2e9e77227b2a1bc3d/smicha">
    <title>The characteristic polynomial of a random permutation matrix</title>
    <description>Stochastic Processes and their Applications</description>
    <link>http://www.bibsonomy.org/bibtex/2f3858466d02837c2e9e77227b2a1bc3d/smicha</link>
    <dc:creator>smicha</dc:creator>
    <dc:date>2008-04-22T14:25:45+02:00</dc:date>
    <dc:subject>
      Feller coupling </dc:subject>
    <content:encoded><![CDATA[
    <link rel="stylesheet" href="http://www.bibsonomy.org/resources/css/rss.css" type="text/css"/>
    <div class="block">
      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/2f3858466d02837c2e9e77227b2a1bc3d/smicha">The characteristic polynomial of a random permutation matrix</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    B. M. <a href="http://www.bibsonomy.org/author/Hambly">Hambly</a>         	     	 
        	  and P. <a href="http://www.bibsonomy.org/author/Keevash">Keevash</a>         	     	 
        	  and N. <a href="http://www.bibsonomy.org/author/O%27Connell">O&#039;Connell</a>         	     	 
        	  and D. <a href="http://www.bibsonomy.org/author/Stark">Stark</a>         	     	 
        	 </span> 
  <em>Stochastic Processes and their Applications</em>
      <b>90</b>
      335--346
  (2000)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/smicha/Feller">Feller</a>
        <a href="http://www.bibsonomy.org/user/smicha/coupling">coupling</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/smicha">smicha</a> 
        
        
        on 2008-04-22 14:25:45 </span></div>
    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/Feller" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/coupling" />
        </rdf:Bag>
    </taxo:topics>
  </item>
<item rdf:about="http://www.bibsonomy.org/bibtex/20a4bfc2d90abc8e4b970642dd7cb96f1/dblp">
    <title>Codegree problems for projective geometries.</title>
    <description>dblp</description>
    <link>http://www.bibsonomy.org/bibtex/20a4bfc2d90abc8e4b970642dd7cb96f1/dblp</link>
    <dc:creator>dblp</dc:creator>
    <dc:date>2007-09-20T00:00:00+02:00</dc:date>
    <dc:subject>
      dblp </dc:subject>
    <content:encoded><![CDATA[
    <link rel="stylesheet" href="http://www.bibsonomy.org/resources/css/rss.css" type="text/css"/>
    <div class="block">
      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/20a4bfc2d90abc8e4b970642dd7cb96f1/dblp">Codegree problems for projective geometries.</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Peter <a href="http://www.bibsonomy.org/author/Keevash">Keevash</a>         	     	 
        	  and Yi <a href="http://www.bibsonomy.org/author/Zhao">Zhao</a>         	     	 
        	 </span> 
  <em>J. Comb. Theory, Ser. B</em>
      <b>97</b>
      919-928
  (2007)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/dblp/dblp">dblp</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/dblp">dblp</a> 
        
        
        on 2007-09-20 00:00:00 </span></div>
    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp" />
        </rdf:Bag>
    </taxo:topics>
  </item>
<item rdf:about="http://www.bibsonomy.org/bibtex/2d80de2492a12a6efe568349c356a0b8b/dblp">
    <title>Packing triangles in a graph and its complement.</title>
    <description>dblp</description>
    <link>http://www.bibsonomy.org/bibtex/2d80de2492a12a6efe568349c356a0b8b/dblp</link>
    <dc:creator>dblp</dc:creator>
    <dc:date>2007-04-30T00:00:00+02:00</dc:date>
    <dc:subject>
      dblp </dc:subject>
    <content:encoded><![CDATA[
    <link rel="stylesheet" href="http://www.bibsonomy.org/resources/css/rss.css" type="text/css"/>
    <div class="block">
      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/2d80de2492a12a6efe568349c356a0b8b/dblp">Packing triangles in a graph and its complement.</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Peter <a href="http://www.bibsonomy.org/author/Keevash">Keevash</a>         	     	 
        	  and Benny <a href="http://www.bibsonomy.org/author/Sudakov">Sudakov</a>         	     	 
        	 </span> 
  <em>Journal of Graph Theory</em>
      <b>47</b>
      203-216
  (2004)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/dblp/dblp">dblp</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/dblp">dblp</a> 
        
        
        on 2007-04-30 00:00:00 </span></div>
    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp" />
        </rdf:Bag>
    </taxo:topics>
  </item>
<item rdf:about="http://www.bibsonomy.org/bibtex/2fecbccae5c398875e06b6059cc077fb0/dblp">
    <title>Sparse halves in triangle-free graphs.</title>
    <description>dblp</description>
    <link>http://www.bibsonomy.org/bibtex/2fecbccae5c398875e06b6059cc077fb0/dblp</link>
    <dc:creator>dblp</dc:creator>
    <dc:date>2007-03-26T00:00:00+02:00</dc:date>
    <dc:subject>
      dblp </dc:subject>
    <content:encoded><![CDATA[
    <link rel="stylesheet" href="http://www.bibsonomy.org/resources/css/rss.css" type="text/css"/>
    <div class="block">
      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/2fecbccae5c398875e06b6059cc077fb0/dblp">Sparse halves in triangle-free graphs.</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Peter <a href="http://www.bibsonomy.org/author/Keevash">Keevash</a>         	     	 
        	  and Benny <a href="http://www.bibsonomy.org/author/Sudakov">Sudakov</a>         	     	 
        	 </span> 
  <em>J. Comb. Theory, Ser. B</em>
      <b>96</b>
      614-620
  (2006)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/dblp/dblp">dblp</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/dblp">dblp</a> 
        
        
        on 2007-03-26 00:00:00 </span></div>
    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp" />
        </rdf:Bag>
    </taxo:topics>
  </item>
<item rdf:about="http://www.bibsonomy.org/bibtex/20d6f44a60d1ecf6ef5065de62f785868/dblp">
    <title>On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs.</title>
    <description>dblp</description>
    <link>http://www.bibsonomy.org/bibtex/20d6f44a60d1ecf6ef5065de62f785868/dblp</link>
    <dc:creator>dblp</dc:creator>
    <dc:date>2007-03-26T00:00:00+02:00</dc:date>
    <dc:subject>
      dblp </dc:subject>
    <content:encoded><![CDATA[
    <link rel="stylesheet" href="http://www.bibsonomy.org/resources/css/rss.css" type="text/css"/>
    <div class="block">
      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/20d6f44a60d1ecf6ef5065de62f785868/dblp">On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs.</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    József <a href="http://www.bibsonomy.org/author/Balogh">Balogh</a>         	     	 
        	  and Peter <a href="http://www.bibsonomy.org/author/Keevash">Keevash</a>         	     	 
        	  and Benny <a href="http://www.bibsonomy.org/author/Sudakov">Sudakov</a>         	     	 
        	 </span> 
  <em>J. Comb. Theory, Ser. B</em>
      <b>96</b>
      919-932
  (2006)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/dblp/dblp">dblp</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/dblp">dblp</a> 
        
        
        on 2007-03-26 00:00:00 </span></div>
    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp" />
        </rdf:Bag>
    </taxo:topics>
  </item>
</rdf:RDF>