<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>University of Isfahan</PublisherName>
				<JournalTitle>Transactions on Combinatorics</JournalTitle>
				<Issn>2251-8657</Issn>
				<Volume>8</Volume>
				<Issue>3</Issue>
				<PubDate PubStatus="epublish">
					<Year>2019</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A generalization of Hall's theorem for $k$-uniform $k$-partite hypergraphs</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>25</FirstPage>
			<LastPage>30</LastPage>
			<ELocationID EIdType="pii">23624</ELocationID>
			
<ELocationID EIdType="doi">10.22108/toc.2019.105022.1506</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Reza</FirstName>
					<LastName>Jafarpour-Golzari</LastName>
<Affiliation>Department of Mathematics, Institute for Advanced Studies in Basic Science (IASBS), Zanjan, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2017</Year>
					<Month>06</Month>
					<Day>27</Day>
				</PubDate>
			</History>
		<Abstract>In this paper we prove a generalized version of Hall&#039;s theorem in graphs‎, ‎for hypergraphs‎. ‎More precisely‎, ‎let $\mathcal{H}$ be a $k$-uniform $k$-partite hypergraph with some ordering on parts as $V_{1}‎, ‎V_{2}‎,‎\ldots‎,‎V_{k}$ such that the subhypergraph generated on $\bigcup_{i=1}^{k-1}V_{i}$ has a unique perfect matching‎. ‎In this case‎, ‎we give a necessary and sufficient condition for having a matching of size $t=|V_{1}|$ in $\mathcal{H}$‎. ‎Some relevant results and counterexamples are given as well‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">$k$-uniform $k$-partite hypergraph‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎matching‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎perfect matching‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎vertex cover‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Hall's theorem</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://toc.ui.ac.ir/article_23624_38a70e95ccee03d4c617e4f14c85f29f.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
