‪Sebastián Bustamante‬ - ‪Google Scholar‬

Get my own profile

Cited by

	All	Since 2019
Citations	20	15
h-index	2	2
i10-index	1	0

0

4

2

201720182019202020212022202320241 1 1 2 3 4 4 1

Co-authors

Maya SteinUniversity of ChileVerified email at dim.uchile.cl
Hiep HanUniversity of Santiago, ChileVerified email at usach.cl

Sebastián Bustamante

Sebastián Bustamante

University of Chile

Verified email at dim.uchile.cl

Graph Theory Combinatorics


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Almost partitioning 2-coloured complete 3-uniform hypergraphs into two monochromatic tight or loose cycles S Bustamante, H Han, M Stein arXiv preprint arXiv:1701.07806, 2017	12	2017
Monochromatic tree covers and Ramsey numbers for set-coloured graphs S Bustamante, M Stein Discrete Mathematics 341 (1), 266-276, 2018	6	2018
Partitioning 2-coloured complete k-uniform hypergraphs into monochromatic ℓ-cycles S Bustamante, M Stein European Journal of Combinatorics 71, 213-221, 2018	2	2018
Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles S Bustamante, H Hàn, M Stein Electronic Notes in Discrete Mathematics 61, 185-190, 2017		2017

The system can't perform the operation now. Try again later.

Articles 1–4