3 papers
math.CO2022
On the anti-Ramsey threshold for non-balanced graphs
Pedro Araújo, Taísa Martins, Letícia Mattos +3
For graphs and , we write if any proper edge-coloring of contains a rainbow copy of , i.e., a copy where no color appear…
math.CO2019
The size-Ramsey number of powers of bounded degree trees
Sören Berger, Yoshiharu Kohayakawa, Giulia Satiko Maesaka +4
Given a positive integer , the -colour size-Ramsey number of a graph is the smallest integer such that there exists a graph with edges with the property that,…
math.CO2018
The step Sidorenko property and non-norming edge-transitive graphs
Daniel Král', Taísa Martins, Péter Pál Pach +1
Sidorenko's Conjecture asserts that every bipartite graph H has the Sidorenko property, i.e., a quasirandom graph minimizes the density of H among all graphs with the same edge den…