On the minimum number of non-monochromatic simplices for Sperner labelings of a regular triangulation

dc.contributor.author	Calvo Pascual, Luis Ángel	es-ES
dc.contributor.author	Merchán Rubira, Susana	es-ES
dc.contributor.author	Raboso, Dulcinea	es-ES
dc.contributor.author	Rodrigo Hitos, Javier	es-ES
dc.contributor.author	Rodriguez García, José Samuel	es-ES
dc.date.accessioned	2025-06-11T11:37:21Z
dc.date.available	2025-06-11T11:37:21Z
dc.identifier.uri	http://hdl.handle.net/11531/99171
dc.description.abstract	https://doi.org/10.48550/arXiv.2506.05581	es-ES
dc.description.abstract	Attending to an open problem in the literature stated by Mirzakhani and Vondr´ak, we give a lower bound of the number of nonmonochromatic simplices for Sperner labelings of the vertices of a triangulation of a given k-simplex with vertices of integer coordinates. This triangulation maximizes the number of simplices over all the triangulations of the k-simplex with vertices of integer coordinates.	en-GB
dc.format.mimetype	application/pdf	es_ES
dc.language.iso	es-ES	es_ES
dc.rights	Creative Commons Reconocimiento-NoComercial-SinObraDerivada España	es_ES
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/es/	es_ES
dc.title	On the minimum number of non-monochromatic simplices for Sperner labelings of a regular triangulation	es_ES
dc.type	info:eu-repo/semantics/workingPaper	es_ES
dc.description.version	info:eu-repo/semantics/draft	es_ES
dc.rights.holder		es_ES
dc.rights.accessRights	info:eu-repo/semantics/openAccess	es_ES
dc.keywords	.	es-ES
dc.keywords	Sperner labeling, Hypergraph labeling problem, Discrete Optimization.	en-GB

Documentos de Trabajo
WorkingPaper, ponencias invitadas y contribuciones en congresos no publicadas

Excepto si se señala otra cosa, la licencia del ítem se describe como Creative Commons Reconocimiento-NoComercial-SinObraDerivada España