<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="https://noad.sci.am/style/common/xsl/oai-style.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/
         http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
	<responseDate>2026-04-13T07:20:54Z</responseDate>
	<request identifier="oai:noad.sci.am:136125" metadataPrefix="oai_dc" verb="GetRecord">
	https://noad.sci.am/oai-pmh-repository.xml</request>
	<GetRecord>
	
  <record>
	<header>
		<identifier>oai:noad.sci.am:136125</identifier>
	    <datestamp>2021-04-19T11:04:52Z</datestamp>
		  <setSpec>dLibraDigitalLibrary:academic:iiap:iiappub</setSpec> 	      <setSpec>dLibraDigitalLibrary</setSpec> 	      <setSpec>dLibraDigitalLibrary:academic</setSpec> 	      <setSpec>dLibraDigitalLibrary:academic:iiap</setSpec> 	    </header>
		<metadata>
	<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title xml:lang="en"><![CDATA[Essential points of the -cube subset partitioning characterisation]]></dc:title>
<dc:creator xml:lang="en"><![CDATA[Sahakyan Hasmik]]></dc:creator>
<dc:description xml:lang="en"><![CDATA[The question of necessary and sufficient conditions for the existence of a simple hypergraph with a given degree sequence is a long-standing open problem. Let ψm(n) denote the set of all degree sequences of simple hypergraphs on vertex set [n]={1,2,⋯,n} that have m edges. A simple characterisation of ψm(n) is defined in terms of its upper and/or lower elements (degree sequences). In the process of finding all upper degree sequences, a number of results have been achieved in this paper. Classes of upper degree sequences with lowest rank (sum of degrees) rmin and with highest rank rmax have been found; in the case of rmin, the unique class of isomorphic hypergraphs has been determined; the case of rmax leads to the simple uniform hypergraph degree sequence problem. A smaller generating set has been found for ψm(n). New classes of upper degree sequences have been generated from the known sequences in dimensions less than n.]]></dc:description>
<dc:publisher xml:lang="en"><![CDATA[Elsevier]]></dc:publisher>
<dc:date xml:lang="en"><![CDATA[22.07.2013]]></dc:date>
<dc:date xml:lang="en"><![CDATA[31.10.2010]]></dc:date>
<dc:type xml:lang="en"><![CDATA[Article]]></dc:type>
<dc:identifier><![CDATA[https://noad.sci.am/dlibra/docmetadata?showContent=true&id=136125]]></dc:identifier>
<dc:identifier><![CDATA[oai:noad.sci.am:136125]]></dc:identifier>
<dc:identifier><![CDATA[http://noad.sci.am/Content/136125/30.pdf]]></dc:identifier>
<dc:language xml:lang="en"><![CDATA[English]]></dc:language>
<dc:relation><![CDATA[oai:noad.sci.am:publication:149572]]></dc:relation>
</oai_dc:dc>

</metadata>
	  </record>	</GetRecord>
</OAI-PMH>
