<p>Yes!<br>
See<br>
<a href="http://wiki.portal.chalmers.se/agda/pmwiki.php?n=Main.IntuitionisticRamseyTheorem">http://wiki.portal.chalmers.se/agda/pmwiki.php?n=Main.IntuitionisticRamseyTheorem</a></p>
<p>Best regards,<br>
David<br>
</p>
<div class="gmail_quote">Den 4 jul 2014 13:29 skrev "Sergei Meshveliani" <<a href="mailto:mechvel@botik.ru">mechvel@botik.ru</a>>:<br type="attribution"><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
People,<br>
<br>
is there publicly available a proof in Agda of the Ramsey's theorem<br>
(about the size of a monochromatic sub-graph in a complete graph)<br>
?<br>
<br>
Thanks,<br>
<br>
------<br>
Sergei<br>
<br>
_______________________________________________<br>
Agda mailing list<br>
<a href="mailto:Agda@lists.chalmers.se">Agda@lists.chalmers.se</a><br>
<a href="https://lists.chalmers.se/mailman/listinfo/agda" target="_blank">https://lists.chalmers.se/mailman/listinfo/agda</a><br>
</blockquote></div>