{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/12491"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/12491","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"On the Parallelization of a Search for Counterexamples to a Conjecture of Erd\\H{o}s","abstract":"<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.</p> <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.</p>","abstract_html":"&lt;p&gt;Denote by <span class=\"etd-inline-math\">k<sub>t</sub>(G)</span> the number of cliques of order $t$ in a graph $G$ having $n$ vertices. Let <span class=\"etd-inline-math\">k<sub>t</sub>(n) = \\min\\{k<sub>t</sub>(G)+k<sub>t</sub>(\\overline{G}) \\}</span> where $\\overline{G}$ denotes the complement of $G$. Let <span class=\"etd-inline-math\">c<sub>t</sub>(n) = {k<sub>t</sub>(n)}/{\\tbinom{n}{t}}</span> and <span class=\"etd-inline-math\">c<sub>t</sub></span> be the limit of <span class=\"etd-inline-math\">c<sub>t</sub>(n)</span> for $n$ going to infinity. A 1962 conjecture of Erd\\H{o}s stating that <span class=\"etd-inline-math\">c<sub>t</sub> = 2<sup>1-\\tbinom{t}{2}</sup></span> was disproved by Thomason in 1989 for all $t\\geq 4$. Tighter counterexamples have been constructed by Jagger, {\\v S}{\\v t}ov{\\&#x27; \\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&gt; &lt;p&gt;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&gt;","abstract_has_math":true,"creators":["Shen, ShengWei"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Computer Science","school":null,"contributors":[],"advisors":["Deza, Antoine","Frantisek Franek, Ned Nedialkov"],"committee_chairs":[],"committee_members":[],"year":2012,"date_issued":"2012-10","date_published":"2012-10","updated_at":"2026-11-18T19:31:38Z","subjects":["clique","coclique","Cayley graph","complete graph","subgraph","parallelization","Computer Sciences","Discrete Mathematics and Combinatorics","Theory and Algorithms"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/10220"],"render_values":[{"text":"https://doi.org/10.71548/10220","href":"https://doi.org/10.71548/10220","code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/7374","8429","3326384"],"render_values":[{"text":"opendissertations/7374","href":null,"code":true},{"text":"8429","href":null,"code":true},{"text":"3326384","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/12491","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/12491","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F12491","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Deza, Antoine","Frantisek Franek, Ned Nedialkov"]},{"key":"dc:contributor.department","label":"Department","values":["Computer Science"]},{"key":"dc:creator","label":"Author","values":["Shen, ShengWei"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-06-18T16:59:48Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-06-18T16:59:48Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2012-09-17"]},{"key":"dc:date.issued","label":"Date","values":["2012-10"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["clique","coclique","Cayley graph","complete graph","subgraph","parallelization","Computer Sciences","Discrete Mathematics and Combinatorics","Theory and Algorithms"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/7374","8429","3326384"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/12491","https://doi.org/10.71548/10220"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<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.</p> <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.</p>"]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science (MSc)"]},{"key":"dc:title","label":"Title","values":["On the Parallelization of a Search for Counterexamples to a Conjecture of Erd\\H{o}s"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Deza, Antoine","Frantisek Franek, Ned Nedialkov"],"dc:contributor.department":["Computer Science"],"dc:creator":["Shen, ShengWei"],"dc:date.accessioned":["2014-06-18T16:59:48Z"],"dc:date.available":["2014-06-18T16:59:48Z"],"dc:date.created":["2012-09-17"],"dc:date.issued":["2012-10"],"dc:description.abstract":["<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.</p> <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.</p>"],"dc:description.degree":["Master of Science (MSc)"],"dc:identifier.other":["opendissertations/7374","8429","3326384"],"dc:identifier.uri":["http://hdl.handle.net/11375/12491","https://doi.org/10.71548/10220"],"dc:subject":["clique","coclique","Cayley graph","complete graph","subgraph","parallelization","Computer Sciences","Discrete Mathematics and Combinatorics","Theory and Algorithms"],"dc:title":["On the Parallelization of a Search for Counterexamples to a Conjecture of Erd\\H{o}s"],"dc:type":["thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:31:38Z"}