SebastiŠn Bustamante
SebastiŠn Bustamante
Verified email at dim.uchile.cl
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
72017
Monochromatic tree covers and Ramsey numbers for set-coloured graphs
S Bustamante, M Stein
Discrete Mathematics 341 (1), 266-276, 2018
42018
Partitioning 2-coloured complete k-uniform hypergraphs into monochromatic ℓ-cycles
S Bustamante, M Stein
European Journal of Combinatorics 71, 213-221, 2018
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