1 citations · 1 across the 16 of their papers we have counts for
5 papers · 1 filter
Quasirandom Latin squares
Jacob W. Cooper, Daniel Kral, Ander Lamaison +1
We prove a conjecture by Garbe et al. [arXiv:2010.07854] by showing that a Latin square is quasirandom if and only if the density of every 2x3 pattern is 1/720+o(1). This result is…
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 .…