8 papers
Ramsey upper density of infinite graph factors
József Balogh, Ander Lamaison
The study of upper density problems on Ramsey theory was initiated by Erdős and Galvin in 1993. In this paper we are concerned with the following problem: given a fixed finite grap…
On a colored Turán problem of Diwan and Mubayi
Ander Lamaison, Alp Müyesser, Michael Tait
Suppose that (red) and (blue) are two graphs on the same vertex set of size , and is some graph with a red-blue coloring of its edges. How large can and be i…
Coloring graphs by translates in the circle
Pablo Candela, Carlos Catala, Robert Hancock +4
The fractional and circular chromatic numbers are the two most studied non-integral refinements of the chromatic number of a graph. Starting from the definition of a coloring base…
Ramsey upper density of infinite graphs
Ander Lamaison
For a fixed infinite graph , we study the largest density of a monochromatic subgraph isomorphic to that can be found in every two-coloring of the edges of .…
Majority Colorings of Sparse Digraphs
Michael Anastos, Ander Lamaison, Raphael Steiner +1
A majority coloring of a directed graph is a vertex-coloring in which every vertex has the same color as at most half of its out-neighbors. Kreutzer, Oum, Seymour, van der Zypen an…
The random strategy in Maker-Breaker graph minor games
Ander Lamaison
In a biased Maker-Breaker game, how good a strategy is for a player can be measured by the bias range for which its rival can win, choosing an appropriate counterstrategy.…