16 citations · 50 across the 16 of their papers we have counts for
6 papers · 1 filter
Ordered Ramsey numbers of loose paths and matchings
Christopher Cox, Derrick Stolee
For a -uniform hypergraph with vertex set , the ordered Ramsey number is the least integer such that every -coloring of the e…
Automated Discharging Arguments for Density Problems in Grids
Derrick Stolee
Discharging arguments demonstrate a connection between local structure and global averages. This makes it an effective tool for proving lower bounds on the density of special sets…
Extending Precolorings to Distinguish Group Actions
Michael Ferrara, Ellen Gethner, Stephen G. Hartke +2
Given a group acting on a set , a -coloring of is distinguishing with respect to if the only that fixes is the identity action.…
Rainbow arithmetic progressions
Steve Butler, Craig Erickson, Leslie Hogben +8
In this paper, we investigate the anti-Ramsey (more precisely, anti-van der Waerden) properties of arithmetic progressions. For positive integers and , the expression $aw([n…
On the independence ratio of distance graphs
James M. Carraher, David Galvin, Stephen G. Hartke +2
A distance graph is an undirected graph on the integers where two integers are adjacent if their difference is in a prescribed distance set. The independence ratio of a distance gr…
Partitioning a graph into highly connected subgraphs
Valentin Borozan, Michael Ferrara, Shinya Fujita +4
Given , a -proper partition of a graph is a partition of such that each part of induces a -connected subgraph of . We…