The following pages link to Sebastián Bustamante (Q1689908):
Displaying 9 items.
- Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles (Q1689909) (← links)
- Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles (Q1750222) (← links)
- (Q2132348) (redirect page) (← links)
- Large immersions in graphs with independence number 3 and 4 (Q2132349) (← links)
- Partitioning infinite hypergraphs into few monochromatic Berge-paths (Q2175777) (← links)
- Monochromatic tree covers and Ramsey numbers for set-coloured graphs (Q2411628) (← links)
- Clique immersions and independence number (Q2674557) (← links)
- Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles (Q5379835) (← links)
- Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles (Q5854893) (← links)
