Bounds on the achromatic number of partial triple systems

dc.contributor.authorDukes, Peter J.
dc.contributor.authorMacGillivray, Gary
dc.contributor.authorParton, Kristin
dc.date.accessioned2021-03-01T23:48:41Z
dc.date.available2021-03-01T23:48:41Z
dc.date.copyright2007en_US
dc.date.issued2007
dc.description.abstractA complete k-colouring of a hypergraph is an assignment of k colours to the points such that (1) there is no monochromatic hyperedge, and (2) identifying any two colours produces a monochromatic hyperedge. The achromatic number of a hypergraph is the maximum k such that it admits a complete k-colouring. We determine the maximum possible achromatic number among all maximal partial triple systems, give bounds on the maximum and minimum achromatic numbers of Steiner triple systems, and present a possible connection between optimal complete colourings and projective dimension.en_US
dc.description.reviewstatusRevieweden_US
dc.description.scholarlevelFacultyen_US
dc.identifier.citationDukes, P. J., MacGillivray, G., & Parton, K. (2007). Bounds on the achromatic number of partial triple systems. Contributions to Discrete Mathematics, 2(1), 1-12. https://doi.org/10.11575/cdm.v2i1.61930en_US
dc.identifier.urihttps://doi.org/10.11575/cdm.v2i1.61930
dc.identifier.urihttp://hdl.handle.net/1828/12742
dc.language.isoenen_US
dc.publisherContributions to Discrete Mathematicsen_US
dc.subject.departmentDepartment of Mathematics and Statistics
dc.titleBounds on the achromatic number of partial triple systemsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Dukes_Peter_ContribDiscreteMath_2007.pdf
Size:
404.46 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2 KB
Format:
Item-specific license agreed upon to submission
Description: