<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://subwiki.org/w/index.php?action=history&amp;feed=atom&amp;title=Perfect_matching</id>
	<title>Perfect matching - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://subwiki.org/w/index.php?action=history&amp;feed=atom&amp;title=Perfect_matching"/>
	<link rel="alternate" type="text/html" href="https://subwiki.org/w/index.php?title=Perfect_matching&amp;action=history"/>
	<updated>2026-04-10T11:49:26Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.41.2</generator>
	<entry>
		<id>https://subwiki.org/w/index.php?title=Perfect_matching&amp;diff=107&amp;oldid=prev</id>
		<title>Vipul: New page: &lt;noinclude&gt;  &lt;/noinclude&gt;  &#039;&#039;&#039;Perfect matching&#039;&#039;&#039;: A matching in a bipartite graph such that every element on one side gets matched to ...</title>
		<link rel="alternate" type="text/html" href="https://subwiki.org/w/index.php?title=Perfect_matching&amp;diff=107&amp;oldid=prev"/>
		<updated>2008-06-09T14:35:39Z</updated>

		<summary type="html">&lt;p&gt;New page: &amp;lt;noinclude&amp;gt;&lt;a href=&quot;/w/index.php?title=Status::Basic_definition&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;Status::Basic definition (page does not exist)&quot;&gt; &lt;/a&gt;&lt;a href=&quot;/w/index.php?title=Topic::Graph_theory&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;Topic::Graph theory (page does not exist)&quot;&gt; &lt;/a&gt;&amp;lt;/noinclude&amp;gt;  &amp;#039;&amp;#039;&amp;#039;Perfect matching&amp;#039;&amp;#039;&amp;#039;: A matching in a bipartite graph such that every element on one side gets matched to ...&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&amp;lt;noinclude&amp;gt;[[Status::Basic definition| ]][[Topic::Graph theory| ]]&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Perfect matching&amp;#039;&amp;#039;&amp;#039;: A matching in a bipartite graph such that every element on one side gets matched to exactly one element on the other side.&lt;br /&gt;
&lt;br /&gt;
No relevant subject wiki entry.&lt;/div&gt;</summary>
		<author><name>Vipul</name></author>
	</entry>
</feed>