<?xml version="1.0" encoding="UTF-8"?>










<rss version="2.0" xmlns:jf="http://www.jivesoftware.com/xmlns/jiveforums/rss">
    <channel>
        <title>Math Forum</title>
        <link>http://mathforum.org/kb</link>
        <description>List of forum topics</description>
        <language>en</language>


        <item>
            <title>Combinatorial problem on subgraphs of the Johnson graph</title>
        
            <link>http://mathforum.org/kb/thread.jspa?messageID=7893329&amp;tstart=0#7893329</link>

        

            <description><![CDATA[Let $1\leqslant m \leqslant n$, $N=\{ 1,\ldots,n\}$. The Johnson graph <br>$J_{n,m}$ has as vertex set all subsets of $N$ of cardinality $m$, two]]></description>

        

            <jf:creationDate>Sep 20, 2012 6:00:02 AM</jf:creationDate>
            <jf:modificationDate>Sep 20, 2012 6:00:02 AM</jf:modificationDate>
            <jf:author>rcm@gmx.co.uk</jf:author>
            <jf:replyCount>0</jf:replyCount>
        </item>


    </channel>
</rss>

