{"id":{"repo_id":"the-open-u","oai_identifier":"oai:oro.open.ac.uk:64246"},"canonical_url":"https://search.ndltd.org/etd/the-open-u/oai:oro.open.ac.uk:64246","repository":{"repo_id":"the-open-u","name":"The Open University","base_url":"https://oro.open.ac.uk/cgi/oai2"},"display":{"title":"Configurations and colouring problems in block designs","abstract":"A Steiner triple system of order v (STS(<i>v</i>)) is called <i>x-chromatic</i> if <i>x</i> is the smallest number of colours needed to avoid monochromatic blocks. Amongst our results on colour class structures we show that every STS (19) is 3- or 4-chromatic, that every 3-chromatic STS(19) has an <i>equitable</i> 3-colouring (meaning that the colours are as uniformly distributed as possible), and that for all admissible v > 25 there exists a 3-chromatic STS(<i>v</i>) which does not admit an equitable 3-colouring. We obtain a formula for the number of independent sets in an STS(<i>v</i>) and use it to show that an STS(21) must contain eight independent points. This leads to a simple proof that every STS(21) is 3- or 4-chromatic. <br></br>Substantially extending existing tabulations, we provide an enumeration of STS trades of up to 12 blocks, and as an application we show that any pair of STS(15)s must be 3<sup>-1</sup>-isomorphic. <br></br>We prove a general theorem that enables us to obtain formulae for the frequencies of occurrence of configurations in triple systems. Some of these are used in our proof that for v > 25 no STS(u) has a 3-existentially closed block intersection graph. Of specific interest in connection with a conjecture of Erdos are 6-sparse and perfect Steiner triple systems, characterized by the avoidance of specific configurations. We describe two direct constructions that produce 6-sparse STS(<i>v</i>)s and we give a recursive construction that preserves 6-sparseness. Also we settle an old question concerning the occurrence of perfect block transitive Steiner triple systems. <br></br>Finally, we consider Steiner 5(2,4, v) designs that are built from collections of Steiner triple systems. We solve a longstanding problem by constructing such systems with v = 61 (Zoe’s design) and <i>v</i> = 100 (the design of the century).","abstract_html":"A Steiner triple system of order v (STS(&lt;i&gt;v&lt;/i&gt;)) is called &lt;i&gt;x-chromatic&lt;/i&gt; if &lt;i&gt;x&lt;/i&gt; is the smallest number of colours needed to avoid monochromatic blocks. Amongst our results on colour class structures we show that every STS (19) is 3- or 4-chromatic, that every 3-chromatic STS(19) has an &lt;i&gt;equitable&lt;/i&gt; 3-colouring (meaning that the colours are as uniformly distributed as possible), and that for all admissible v &gt; 25 there exists a 3-chromatic STS(&lt;i&gt;v&lt;/i&gt;) which does not admit an equitable 3-colouring. We obtain a formula for the number of independent sets in an STS(&lt;i&gt;v&lt;/i&gt;) and use it to show that an STS(21) must contain eight independent points. This leads to a simple proof that every STS(21) is 3- or 4-chromatic. &lt;br&gt;&lt;/br&gt;Substantially extending existing tabulations, we provide an enumeration of STS trades of up to 12 blocks, and as an application we show that any pair of STS(15)s must be 3&lt;sup&gt;-1&lt;/sup&gt;-isomorphic. &lt;br&gt;&lt;/br&gt;We prove a general theorem that enables us to obtain formulae for the frequencies of occurrence of configurations in triple systems. Some of these are used in our proof that for v &gt; 25 no STS(u) has a 3-existentially closed block intersection graph. Of specific interest in connection with a conjecture of Erdos are 6-sparse and perfect Steiner triple systems, characterized by the avoidance of specific configurations. We describe two direct constructions that produce 6-sparse STS(&lt;i&gt;v&lt;/i&gt;)s and we give a recursive construction that preserves 6-sparseness. Also we settle an old question concerning the occurrence of perfect block transitive Steiner triple systems. &lt;br&gt;&lt;/br&gt;Finally, we consider Steiner 5(2,4, v) designs that are built from collections of Steiner triple systems. We solve a longstanding problem by constructing such systems with v = 61 (Zoe’s design) and &lt;i&gt;v&lt;/i&gt; = 100 (the design of the century).","abstract_has_math":false,"creators":["Forbes, Anthony Duncan"],"institution":"The Open University","degree_name":"phd","degree_level":"doctoral","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2006,"date_issued":"2006-12","date_published":"2006-12","updated_at":"2026-11-19T09:37:49Z","subjects":[],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null,"record_url":null,"record_label":null,"record_kind":null,"record_source":null,"download_url":"https://oro.open.ac.uk/64246/1/13917230.pdf","download_label":"Download PDF","download_source":"dc:identifier.uri","access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://oro.open.ac.uk/cgi/oai2?verb=GetRecord&metadataPrefix=uketd_dc&identifier=oai%3Aoro.open.ac.uk%3A64246","prefix":"uketd_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Forbes, Anthony Duncan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2006-12-13"]},{"key":"dc:date.issued","label":"Date","values":["2006-12"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["The Open University"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["https://oro.open.ac.uk/64246/"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["doctoral"]},{"key":"dc:type.qualificationname","label":"Dc Type Qualificationname","values":["phd"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://oro.open.ac.uk/64246/1/13917230.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["A Steiner triple system of order v (STS(<i>v</i>)) is called <i>x-chromatic</i> if <i>x</i> is the smallest number of colours needed to avoid monochromatic blocks. Amongst our results on colour class structures we show that every STS (19) is 3- or 4-chromatic, that every 3-chromatic STS(19) has an <i>equitable</i> 3-colouring (meaning that the colours are as uniformly distributed as possible), and that for all admissible v > 25 there exists a 3-chromatic STS(<i>v</i>) which does not admit an equitable 3-colouring. We obtain a formula for the number of independent sets in an STS(<i>v</i>) and use it to show that an STS(21) must contain eight independent points. This leads to a simple proof that every STS(21) is 3- or 4-chromatic. <br></br>Substantially extending existing tabulations, we provide an enumeration of STS trades of up to 12 blocks, and as an application we show that any pair of STS(15)s must be 3<sup>-1</sup>-isomorphic. <br></br>We prove a general theorem that enables us to obtain formulae for the frequencies of occurrence of configurations in triple systems. Some of these are used in our proof that for v > 25 no STS(u) has a 3-existentially closed block intersection graph. Of specific interest in connection with a conjecture of Erdos are 6-sparse and perfect Steiner triple systems, characterized by the avoidance of specific configurations. We describe two direct constructions that produce 6-sparse STS(<i>v</i>)s and we give a recursive construction that preserves 6-sparseness. Also we settle an old question concerning the occurrence of perfect block transitive Steiner triple systems. <br></br>Finally, we consider Steiner 5(2,4, v) designs that are built from collections of Steiner triple systems. We solve a longstanding problem by constructing such systems with v = 61 (Zoe’s design) and <i>v</i> = 100 (the design of the century)."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dcterms:accessrights","label":"Dcterms Accessrights","values":["public"]},{"key":"dc:title","label":"Title","values":["Configurations and colouring problems in block designs"]}]}],"canonical_facts":{"dc:creator":["Forbes, Anthony Duncan"],"dc:date":["2006-12-13"],"dc:date.issued":["2006-12"],"dc:description.abstract":["A Steiner triple system of order v (STS(<i>v</i>)) is called <i>x-chromatic</i> if <i>x</i> is the smallest number of colours needed to avoid monochromatic blocks. Amongst our results on colour class structures we show that every STS (19) is 3- or 4-chromatic, that every 3-chromatic STS(19) has an <i>equitable</i> 3-colouring (meaning that the colours are as uniformly distributed as possible), and that for all admissible v > 25 there exists a 3-chromatic STS(<i>v</i>) which does not admit an equitable 3-colouring. We obtain a formula for the number of independent sets in an STS(<i>v</i>) and use it to show that an STS(21) must contain eight independent points. This leads to a simple proof that every STS(21) is 3- or 4-chromatic. <br></br>Substantially extending existing tabulations, we provide an enumeration of STS trades of up to 12 blocks, and as an application we show that any pair of STS(15)s must be 3<sup>-1</sup>-isomorphic. <br></br>We prove a general theorem that enables us to obtain formulae for the frequencies of occurrence of configurations in triple systems. Some of these are used in our proof that for v > 25 no STS(u) has a 3-existentially closed block intersection graph. Of specific interest in connection with a conjecture of Erdos are 6-sparse and perfect Steiner triple systems, characterized by the avoidance of specific configurations. We describe two direct constructions that produce 6-sparse STS(<i>v</i>)s and we give a recursive construction that preserves 6-sparseness. Also we settle an old question concerning the occurrence of perfect block transitive Steiner triple systems. <br></br>Finally, we consider Steiner 5(2,4, v) designs that are built from collections of Steiner triple systems. We solve a longstanding problem by constructing such systems with v = 61 (Zoe’s design) and <i>v</i> = 100 (the design of the century)."],"dc:format":["application/pdf"],"dc:identifier.uri":["https://oro.open.ac.uk/64246/1/13917230.pdf"],"dc:language":["en"],"dc:publisher.institution":["The Open University"],"dc:relation.isreferencedby":["https://oro.open.ac.uk/64246/"],"dcterms:accessrights":["public"],"dc:title":["Configurations and colouring problems in block designs"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["doctoral"],"dc:type.qualificationname":["phd"]},"updated_at":"2026-11-19T09:37:49Z"}