Josefran de Oliveira Bastos

Generating author description...

All published works

Action	Title	Year	Authors
+	Graphs with many edge-colorings such that complete graphs are rainbow	2023	Josefran de Oliveira Bastos Carlos Hoppen Hanno Lefmann Andy Oertel Dionatan Ricardo Schmidt
+	Maximum number of r-edge-colorings such that all copies of Kk are rainbow	2021	Josefran de Oliveira Bastos Hanno Lefmann Andy Oertel Carlos Hoppen Dionatan Ricardo Schmidt
+	The number of Gallai k-colorings of complete graphs	2019	Josefran de Oliveira Bastos Fabrício Benevides Jie Han
+	Counting Gallai 3-colorings of complete graphs	2019	Josefran de Oliveira Bastos Fabrício Benevides Guilherme Oliveira Mota Ignasi Sau
+ PDF Chat	Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version	2018	Josefran de Oliveira Bastos Guilherme Oliveira Mota Mathias Schacht Jakob Schnitzer Fabian Schulenburg
+	Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version	2018	Josefran de Oliveira Bastos Guilherme Oliveira Mota Mathias Schacht Jakob Schnitzer Fabian Schulenburg
+	Counting Gallai 3-colorings of complete graphs	2018	Josefran de Oliveira Bastos Fabrício Benevides Guilherme Oliveira Mota Ignasi Sau
+	The number of Gallai k-colorings of complete graphs	2018	Josefran de Oliveira Bastos Fabrício Benevides Jie Han
+	Counting Gallai 3-colorings of complete graphs	2018	Josefran de Oliveira Bastos Fabrício Benevides Guilherme Oliveira Mota Ignasi Sau
+ PDF Chat	Loose Hamiltonian cycles forced by large (k− 2)-degree - sharp version	2017	Josefran de Oliveira Bastos Guilherme Oliveira Mota Mathias Schacht Jakob Schnitzer Fabian Schulenburg
+ PDF Chat	Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version	2017	Josefran de Oliveira Bastos Guilherme Oliveira Mota Mathias Schacht Jakob Schnitzer Fabian Schulenburg
+	Loose Hamiltonian cycles forced by large $(k-2)$-degree - sharp version	2017	Josefran de Oliveira Bastos Guilherme Oliveira Mota Mathias Schacht Jakob Schnitzer Fabian Schulenburg
+	Loose Hamiltonian cycles forced by ( k − 2)-degree – approximate version	2016	Josefran de Oliveira Bastos Guilherme Oliveira Mota Mathias Schacht Jakob Schnitzer Fabian Schulenburg
+ PDF Chat	Packing densities of layered permutations and the minimum number of monotone sequences in layered permutations	2016	Josefran de Oliveira Bastos Leonardo N. Coregliano

Common Coauthors

Coauthor	Papers Together
Guilherme Oliveira Mota	9
Mathias Schacht	6
Jakob Schnitzer	6
Fabian Schulenburg	6
Fabrício Benevides	5
Ignasi Sau	3
Hanno Lefmann	2
Dionatan Ricardo Schmidt	2
Jie Han	2
Andy Oertel	2
Carlos Hoppen	2
Leonardo N. Coregliano	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES	2004	Noga Alon József Balogh Peter Keevash Benny Sudakov	5
+	Perfect couples of graphs	1992	János Körner Gábor Simonyi Zsolt Tuza	4
+	Loose Hamilton cycles in hypergraphs	2011	Peter Keevash Daniela Kühn Richard Mycroft Deryk Osthus	4
+ PDF Chat	Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs	2013	Enno Buß Hiệp Hàn Mathias Schacht	4
+	Hamilton ℓ-cycles in uniform hypergraphs	2010	Daniela Kühn Richard Mycroft Deryk Osthus	4
+	Minimum codegree threshold for Hamilton ℓ-cycles in k-uniform hypergraphs	2015	Jie Han Yi Zhao	4
+	Graph Pairs and their Entropies: Modularity Problems	2000	János Körner Gábor Simonyi	4
+	Hamiltonian chains in hypergraphs	1999	Gyula Y. Katona H. A. Kierstead	4
+	Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree	2006	Daniela Kühn Deryk Osthus	4
+	None	2004	Dan Archdeacon Joanna A. Ellis-Monaghan David Fisher Dalibor Fronček P. C. B. Lam Suzanne M. Seager Bing Wei Raphael Yuster	4
+	An approximate Dirac-type theorem for k-uniform hypergraphs	2008	Vojtěch Rödl Endre Szemerédi Andrzej Ruciński	4
+	Dirac-type results for loose Hamilton cycles in uniform hypergraphs	2009	Hiệp Hàn Mathias Schacht	4
+	A Dirac-Type Theorem for 3-Uniform Hypergraphs	2006	Vojtěch Rödl Andrzej Ruciński Endre Szemerédi	4
+	Edge-colorings of graphs avoiding complete graphs with a prescribed coloring	2017	Fabrício Benevides Carlos Hoppen Rudini Sampaio	4
+	On graphs with a large number of edge-colorings avoiding a rainbow triangle	2017	Carlos Hoppen Hanno Lefmann Knut Odermann	4
+	A Rainbow Erdös--Rothschild Problem	2017	Carlos Hoppen Hanno Lefmann Knut Odermann	4
+	Dirac-Type Questions For Hypergraphs — A Survey (Or More Problems For Endre To Solve)	2010	Vojtěch Rödl Andrzej Ruciński	3
+ PDF Chat	Gallai-Colorings of Triples and 2-Factors of	2013	Lynn Chua András Gyárfás Chetak Hossain	3
+	Multicolour containers and the entropy of decorated graph limits	2016	Victor Falgas–Ravry Kelly O'Connell Johanna Strömberg Andrew J. Uzzell	3
+ PDF Chat	Recent advances on Dirac-type problems for hypergraphs	2016	Yi Zhao	3
+	Hamiltonian chains in hypergraphs	1999	Gyula Y. Katona H. A. Kierstead	3
+ PDF Chat	Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version	2017	Josefran de Oliveira Bastos Guilherme Oliveira Mota Mathias Schacht Jakob Schnitzer Fabian Schulenburg	3
+	The number of K m,m -free graphs	2011	József Balogh Wojciech Samotij	2
+ PDF Chat	Counting sum-free sets in abelian groups	2013	Noga Alon József Balogh Robert Morris Wojciech Samotij	2
+	A remark on the number of edge colorings of graphs	2005	József Balogh	2
+	Gallai colorings of non-complete graphs	2009	András Gyárfás Gábor N. Sárközy	2
+	Gallai–Ramsey numbers for cycles	2009	Shinya Fujita Colton Magnant	2
+	The Erdős–Hajnal conjecture for rainbow triangles	2014	Jacob Fox Andrey Grinshpun János Pach	2
+	An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth	1998	Yoshiharu Kohayakawa B. Kreuter Angelika Steger	2
+	Independent sets in hypergraphs	2014	József Balogh Robert Morris Wojciech Samotij	2
+	Acyclic edge-coloring using entropy compression	2013	Louis Esperet Aline Parreau	2
+	The number of edge colorings with no monochromatic triangle	1996	Raphael Yuster	2
+ PDF Chat	The Number Of Orientations Having No Fixed Tournament	2006	Ilan Alon Raphael Yuster	2
+	The number of maximal sum-free subsets of integers	2015	József Balogh Hong Liu Maryam Sharifzadeh Andrew Treglown	2
+ PDF Chat	The number of the maximal triangle-free graphs	2014	József Balogh Šárka Petříčková	2
+	A local lemma via entropy compression	2015	Rogério Gomes Alves Aldo Procacci Rémy Sanchis	2
+	On the Number of<i>B<sub>h</sub></i>-Sets	2015	Domingos Dellamonica Yoshiharu Kohayakawa Sang June Lee Vojtěch Rödl Wojciech Samotij	2
+ PDF Chat	Edge colorings of complete graphs without tricolored triangles	2004	András Gyárfás Gábor Simony	2
+	Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors	2018	Hiệp Hàn Andrea Jiménez	2
+	Gallai–Ramsey Numbers of Odd Cycles and Complete Bipartite Graphs	2018	Ming Chen Yusheng Li Chaoping Pei	2
+	All partitions have small parts — Gallai–Ramsey numbers of bipartite graphs	2018	Haibo Wu Colton Magnant Pouria Salehi Nowbandegani Suman Xia	2
+ PDF Chat	The Number of Subsets of Integers with No<i>k</i>-Term Arithmetic Progression	2016	József Balogh Hong Liu Maryam Sharifzadeh	2
+	The number of C2-free graphs	2016	Robert Morris David Saxton	2
+ PDF Chat	The Typical Structure of Gallai Colorings and Their Extremal Graphs	2019	József Balogh Lina Li	2
+	The number of Gallai k-colorings of complete graphs	2019	Josefran de Oliveira Bastos Fabrício Benevides Jie Han	2
+	Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs	2015	Jie Han Yi Zhao	2
+ PDF Chat	The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques	2017	Oleg Pikhurko Katherine Staden Zelealem B. Yilma	2
+	Szemeredi''s Regularity Lemma and its applications in graph theory	1995	János Komlós Miklós Simonovits	1
+ PDF Chat	A Combinatorial Problem in Geometry	2009	P. Erdős G. Szckeres	1
+ PDF Chat	Loose Hamiltonian cycles forced by large (k− 2)-degree - sharp version	2017	Josefran de Oliveira Bastos Guilherme Oliveira Mota Mathias Schacht Jakob Schnitzer Fabian Schulenburg	1