<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/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-11-21T03:43:42Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/12491" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/12491</identifier><datestamp>2026-09-24T01:05:57Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">Deza, Antoine</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">Frantisek Franek, Ned Nedialkov</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Shen, ShengWei</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Computer Science</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2014-06-18T16:59:48Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2014-06-18T16:59:48Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="created" lang="en_US">2012-09-17</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2012-10</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other" lang="en_US">opendissertations/7374</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other" lang="en_US">8429</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other" lang="en_US">3326384</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/12491</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/10220</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">&lt;p>Denote by $k_t(G)$ the number of cliques of order $t$ in a graph $G$ having $n$ vertices. Let $k_t(n) = \min\{k_t(G)+k_t(\overline{G}) \}$ where $\overline{G}$ denotes the complement of $G$. Let $c_t(n) = {k_t(n)}/{\tbinom{n}{t}}$ and $c_t$ be the limit of $c_t(n)$ for $n$ going to infinity. A 1962 conjecture of Erd\H{o}s stating that $c_t = 2^{1-\tbinom{t}{2}}$ was disproved by Thomason in 1989 for all $t\geq 4$. Tighter counterexamples have been constructed by Jagger, {\v S}{\v t}ov{\' \i}{\v c}ek and Thomason in 1996, by Thomason for $t\leq 6$ in 1997, and by Franek for $t=6$ in 2002. Further tightenings $t=6,7$ and $8$ was recently obtained by Deza, Franek, and Liu.&lt;/p> &lt;p>We investigate the computational framework used by Deza, Franek, and Liu. In particular, we present the benefits and limitations of different parallel computer memory architectures and parallel programming models. We propose a functional decomposition approach which is implemented in C++ with POSIX thread (Pthread) libraries for multi-threading. Computational benchmarking on the parallelized framework and a performance analysis including a comparison with the original computational framework are presented.&lt;/p></dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Master of Science (MSc)</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">clique</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">coclique</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Cayley graph</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">complete graph</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">subgraph</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">parallelization</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Computer Sciences</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Discrete Mathematics and Combinatorics</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Theory and Algorithms</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Computer Sciences</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">On the Parallelization of a Search for Counterexamples to a Conjecture of Erd\H{o}s</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>