<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel rdf:about="https://www.um.edu.mt/library/oar/handle/123456789/23634">
    <title>OAR@UM Collection:</title>
    <link>https://www.um.edu.mt/library/oar/handle/123456789/23634</link>
    <description />
    <items>
      <rdf:Seq>
        <rdf:li rdf:resource="https://www.um.edu.mt/library/oar/handle/123456789/24489" />
        <rdf:li rdf:resource="https://www.um.edu.mt/library/oar/handle/123456789/24472" />
        <rdf:li rdf:resource="https://www.um.edu.mt/library/oar/handle/123456789/24461" />
        <rdf:li rdf:resource="https://www.um.edu.mt/library/oar/handle/123456789/24444" />
      </rdf:Seq>
    </items>
    <dc:date>2026-04-14T11:17:14Z</dc:date>
  </channel>
  <item rdf:about="https://www.um.edu.mt/library/oar/handle/123456789/24489">
    <title>The Collection V</title>
    <link>https://www.um.edu.mt/library/oar/handle/123456789/24489</link>
    <description>Title: The Collection V
Editors: Sciriha, Irene; Telenta, Tanya
Abstract: Fifth issue of The Collection, a journal by the Department of Mathematics at the University of Malta.</description>
    <dc:date>2002-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="https://www.um.edu.mt/library/oar/handle/123456789/24472">
    <title>New necessary and sufficient conditions for the Zarankiewicz conjecture on crossing numbers</title>
    <link>https://www.um.edu.mt/library/oar/handle/123456789/24472</link>
    <description>Title: New necessary and sufficient conditions for the Zarankiewicz conjecture on crossing numbers
Abstract: The purpose of this presentation is to give a historical outline about the theory of crossing&#xD;
numbers, and to present the current status of long standing problems on crossing numbers of complete bipartite graphs. A set of new necessary and sufficient conditions are given for the Zarankiewicz conjecture on the crossing number of complete bipartite graphs. These conditions are expressed in terms of the crossing numbers' divisibility properties and their expressibility as polynomials.</description>
    <dc:date>2002-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="https://www.um.edu.mt/library/oar/handle/123456789/24461">
    <title>Boolean matrices</title>
    <link>https://www.um.edu.mt/library/oar/handle/123456789/24461</link>
    <description>Title: Boolean matrices
Abstract: In this short note, we will use Boolean matrices to help us find some interesting graph theoretical properties regarding the distance and index of a graph. First we will give some definitions that are necessary for the theorems which follow.</description>
    <dc:date>2002-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="https://www.um.edu.mt/library/oar/handle/123456789/24444">
    <title>A new form of primes</title>
    <link>https://www.um.edu.mt/library/oar/handle/123456789/24444</link>
    <description>Title: A new form of primes
Abstract: Let P1, P2, ...., Pk,... denotes the ordered sequence of primes. We will consider primes of the form p=1modpi. Moreover we give a new proof to the converse W. Isean's Theorem, first proved by Lagrange.</description>
    <dc:date>2002-01-01T00:00:00Z</dc:date>
  </item>
</rdf:RDF>

