activity
20152022
most citedFinitely forcible graph limits are universal

2 citations · 2 across the 4 of their papers we have counts for

collaborators
Showing 2020Show all

2 papers · 1 filter

math.CO2020

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…

math.CO2020

Hadwiger meets Cayley

Jacob W. Cooper, Adam Kabela, Daniel Král' +1

We show that every connected -chromatic graph contains at least spanning trees.