5 citations · 5 across the 2 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019
On a Conjecture of Nagy on Extremal Densities
A. Nicholas Day, Amites Sarkar
We disprove a conjecture of Nagy on the maximum number of copies N(G,H) of a fixed graph G in a large graph H with prescribed edge density. Nagy conjectured that for all G, the qua…
math.CO2019
Maker-Breaker Percolation Games II: Escaping to Infinity
A. Nicholas Day, Victor Falgas-Ravry
Let be an infinite connected graph, and let be a vertex of . We consider the following positional game. Two players, Maker and Breaker, play in alternating turns. Init…