14 citations · 66 across the 66 of their papers we have counts for
6 papers · 1 filter
Avoiding a partial Latin square with an isotope of a given Latin square
Stijn Cambie, Ian M. Wanless
For all sufficiently large , we prove that every Latin square of order can be made to avoid any prescribed partial Latin square of order by permuting only its rows and c…
Short Proofs for the Minimum Number of Determined Circles
Stijn Cambie, Denis Paliy, Rafał Wrona
We present short proofs for the main parts of the recently completed solution of Erdős Problem 506, which asks for the minimum number of distinct circles determined by a finite pla…
Four collinear points or six visible points
Stijn Cambie
Every finite planar set of at least points contains four collinear points or six pairwise visible points.
Brown-Gerver-Ramsey Theorems in Small Dimensions
Stijn Cambie, Erik Kalviainen, J. Shallit
We consider infinite walks in with standard unit basis vector steps that avoid collinear points, and show that these walks exist for $(k,t) \in \{(6,3), (4,4), (…
An infinite small-step -walk with no collinear triple
Stijn Cambie, Erik Kalviainen
We construct an infinite walk in whose steps come from a fixed set of sixteen vectors and no three of whose vertices are collinear, answering a problem of Gerver and…
The number and average length of subpaths in graphs
Stijn Cambie
We study extremal questions on the average length and the number of subpaths in a graph. In particular, we prove the questions of Jamison (from ) for the analogous conc…