Title	The achromatic number of Knesser graphs and their relationship with Steiner triple systems
Creator	Araujo-Pardo, Gabriela
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2017-08-21T09:23
Description	In this talk we give the notion of complete colorings in graphs, achromatic number, Knesser graphs and Steiner triple systems . Also, we explain how the Steiner triple systems solve the problem about the existence of complete colorations on Knesser graphs that attain the upper bound of the achromatic number, where the achromatic number of a graph G is the maximum integer value for the number of chromatic classes in a complete and proper coloring of G.
Extent	28 minutes
Subject	Mathematics; Convex and discrete geometry; Group theory and generalizations; Discrete mathematics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: UNAM
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2018-03-23
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0364416
URI	http://hdl.handle.net/2429/64886
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos