Sebastián Bustamante

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Clique immersions and independence number	2022	Sebastián Bustamante Daniel A. Quiroz Maya Stein José Zamora
+ PDF Chat	Partitioning Infinite Hypergraphs into Few Monochromatic Berge-Paths	2020	Sebastián Bustamante Jan Corsten Nóra Frankl
+ PDF Chat	Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles	2020	Sebastián Bustamante Jan Corsten Nóra Frankl Alexey Pokrovskiy Jozef Skokan
+	Clique immersions and independence number	2019	Sebastián Bustamante Daniel A. Quiroz Maya Stein José Zamora
+	Partitioning infinite hypergraphs into few monochromatic Berge-paths	2019	Sebastián Bustamante Jan Corsten Nóra Frankl
+	Clique immersions and independence number	2019	Sebastián Bustamante Daniel A. Quiroz Maya Stein José Zamora
+	Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles	2018	Sebastián Bustamante Hiệp Hàn Maya Stein
+	Partitioning 2-coloured complete <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml7" display="inline" overflow="scroll" altimg="si7.gif"><mml:mi>k</mml:mi></mml:math>-uniform hypergraphs into monochromatic <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml8" display="inline" overflow="scroll" altimg="si8.gif"><mml:mi>ℓ</mml:mi></mml:math>-cycles	2018	Sebastián Bustamante Maya Stein
+ PDF Chat	Monochromatic tree covers and Ramsey numbers for set-coloured graphs	2017	Sebastián Bustamante Maya Stein
+	Almost partitioning 2-coloured complete 3-uniform hypergraphs into two monochromatic tight or loose cycles	2017	Sebastián Bustamante Hiệp Hàn Maya Stein
+	Monochromatic tree covers for multicoloured graphs	2015	Sebastián Bustamante Maya Stein

Common Coauthors

Coauthor	Papers Together
Maya Stein	8
Daniel A. Quiroz	3
Jan Corsten	3
José Zamora	3
Nóra Frankl	3
Hiệp Hàn	2
Jozef Skokan	1
Alexey Pokrovskiy	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture	2009	Stéphane Bessy Stéphan Thomassé	6
+	Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles	1998	Tomasz Łuczak Vojtěch Rödl Endre Szemerédi	5
+	Vertex covers by monochromatic pieces — A survey of results and problems	2015	András Gyárfás	5
+	Improved monochromatic loose cycle partitions in hypergraphs	2014	Gábor N. Sárközy	5
+	Vertex coverings by monochromatic cycles and trees	1991	Péter L. Erdős András Gyárfás L. Pyber	5
+ PDF Chat	Monochromatic Path and Cycle Partitions in Hypergraphs	2013	András Gyárfás Gábor N. Sárközy	5
+	Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles	2008	Peter Allen	5
+	Partitioning edge-coloured complete graphs into monochromatic cycles and paths	2014	Alexey Pokrovskiy	5
+	An improved bound for the monochromatic cycle partition number	2006	András Gyárfás Miklós Ruszinkó Gábor N. Sárközy Endre Szemerédi	4
+ PDF Chat	Monochromatic Loose-Cycle Partitions in Hypergraphs	2014	András Gyárfás Gábor N. Sárközy	3
+	Decompositions of edge-colored infinite complete graphs into monochromatic paths	2016	Márton Elekes Dániel T. Soukup Lajos Soukup Zoltán Szentmiklóssy	3
+ PDF Chat	Monochromatic components in edge-colored complete uniform hypergraphs	2011	Zoltán Király	2
+	Weakened Ramsey numbers	1999	Heiko Harborth Meinhard Möller	2
+ PDF Chat	Multipartite Hypergraphs Achieving Equality in Ryser’s Conjecture	2015	Ron Aharoni János Barát Ian M. Wanless	2
+	A generalization of Ramsey theory for graphs	1978	Kai-Min Chung C.L. Liu	2
+	Set colourings of graphs	2006	Béla Bollobás Andrew Thomason	2
+ PDF Chat	Partition relations for cardinal numbers	1965	Péter L. Erdős A. Hajnal R. Rado	2
+	Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture	2005	Ken‐ichi Kawarabayashi Michael D. Plummer Bjarne Toft	2
+	Monochromatic Matchings in the Shadow Graph of Almost Complete Hypergraphs	2010	András Gyárfás Gábor N. Sárközy Endre Szemerédi	2
+	Graph minors XXIII. Nash-Williams' immersion conjecture	2009	Neil Robertson Paul Seymour	2
+ PDF Chat	Zur allgemeinen Kurventheorie	1927	Karl Menger	2
+ PDF Chat	On Ryser's conjecture	2012	Penny Haxell Alex Scott	2
+ PDF Chat	Independent sets in graphs with an excluded clique minor	2007	David R. Wood	2
+	Around a biclique cover conjecture	2012	G. Chen Shinya Fujita András Gyárfás Jenö Lehel Ágnes Tóth	2
+	Complete graph immersions in dense graphs	2017	Sylvia Vergara S.	2
+	On a Problem upon Configurations Contained in Graphs with Given Chromatic Number	1988	F. Lescure H. Meyniel	2
+	Set-coloring of Edges and Multigraph Ramsey Numbers	2009	Xiaodong Xu Zehui Shao Wenlong Su Zhenchong Li	2
+	A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs	1952	G. A. Dirac	2
+	Partitioning by Monochromatic Trees	1996	Penny Haxell Yoshiharu Kohayakawa	2
+ PDF Chat	Maximum degree and fractional matchings in uniform hypergraphs	1981	Zoltán Füredi	2
+	None	2005	Edy Tri Baskoro Mirka Miller Jozef Širáň Martin Sutton	2
+	On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree	2009	Hiệp Hàn Yury Person Mathias Schacht	2
+	Complete Minors and Independence Number	2010	Jacob Fox	2
+	R(Cn,Cn,Cn)⩽(4+o(1))n	1999	Tomasz Łuczak	2
+	On a Problem of Formal Logic	1930	Frank Plumpton Ramsey	2
+ PDF Chat	The Ramsey Number for 3-Uniform Tight Hypergraph Cycles	2009	Penny Haxell Tomasz Łuczak Yuejian Peng V. Rödl Andrzej Ruciński Jozef Skokan	2
+	A Dirac-Type Theorem for 3-Uniform Hypergraphs	2006	Vojtěch Rödl Andrzej Ruciński Endre Szemerédi	2
+ PDF Chat	Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs	2007	András Gyárfás Jenö Lehel Gábor N. Sárközy R. H. Schelp	2
+ PDF Chat	A minimum degree condition forcing complete graph immersion	2014	Matt DeVos Zdeněk Dvořák Jacob Fox Jessica McDonald Bojan Mohar Diego Scheide	2
+ PDF Chat	Large minors in graphs with given independence number	2011	József Balogh Alexandr Kostochka	2
+	The Ramsey number for hypergraph cycles I	2005	Penny Haxell Tomasz Łuczak Yuejian Peng V. Rödl Andrzej Ruciński Miklós Simonovits Jozef Skokan	2
+	None	2009	András Gyárfás Gábor N. Sárközy R. H. Schelp	2
+	Short paths in quasi-random triple systems with sparse underlying graphs	2006	Joanna Polcyn Vojtěch Rödl Andrzej Ruciński Endre Szemerédi	2
+ PDF Chat	Generalizing the Ramsey Problem through Diameter	2001	Dhruv Mubayi	2
+	None	2002		2
+ PDF Chat	A Note on Covering Edge Colored Hypergraphs by Monochromatic Components	2014	Shinya Fujita Michitaka Furuya András Gyárfás Ágnes N. Tóth	2
+ PDF Chat	Immersing small complete graphs	2010	Matt DeVoss Ken‐ichi Kawarabayashi Bojan Mohar Haruko Okamura	2
+	An extremal function for contractions of graphs	1984	Andrew Thomason	2
+	Extremal Hypergraphs for Ryser's Conjecture: Home-Base Hypergraphs	2014	Penny Haxell Lothar Narins Tibor Szabó	2
+	Monochromatic Structures in Edge-coloured Graphs and Hypergraphs - A survey	2015	Shinya Fujita Henry Liu Colton Magnant	2