7 papers
Canonical Ramsey theorem for graphs with clean intersections
Matías Azócar Carvajal, Ayush Basu, Christian Reiher +3
Extending earlier results of Nešetřil and Rödl [Selective graphs and hypergraphs, Ann. Discrete Math. 3 (1978), 181--189], we show that for every ordered graph there exist an o…
Semidegree threshold for spanning trees in oriented graphs
Pedro Araújo, Giovanne Santos, Maya Stein
We show that for all and , there is some such that, if , then every oriented graph on vertices with minimum semidegree at least $(3/8…
The Brown-Erdős-Sós conjecture in dense triple systems
Giovanne Santos, Mykhaylo Tyomkyn
The famous Brown-Erdős-Sós conjecture from 1973 states, in an equivalent form, that for any fixed and integer every sufficiently large linear -uniform hypergraph…
Antidirected trees in directed graphs
George Kontogeorgiou, Giovanne Santos, Maya Stein
The Komlós-Sárközy-Szemerédi (KSS) theorem establishes that a certain bound on the minimum degree of a graph guarantees it contains all bounded degree trees of the same order. Rece…
Canonical Ramsey numbers for partite hypergraphs
Matías Azócar Carvajal, Giovanne Santos, Mathias Schacht
We show that canonical Ramsey numbers for partite hypergraphs grow single exponentially for any fixed uniformity.
A study on token digraphs
Cristina G. Fernandes, Carla N. Lintzmayer, Juan P. Peña +3
For a digraph of order and an integer , the -token digraph of is the graph whose vertices are all -subsets of vertices of and, given two su…
Packing large balanced trees into bipartite graphs
Cristina G. Fernandes, Tássio Naia, Giovanne Santos +1
We prove that for every there exists such that for every any family of up to trees having at most $(1-γ…