22 citations · 93 across the 17 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.CO2021★ 1 cited
Exact solutions to the Erdős-Rothschild problem
Oleg Pikhurko, Katherine Staden
Let be a sequence of natural numbers. For a graph , let denote the number of colourings of the edges of with colours $1,\d…
math.CO2021
Stability for the Erdős-Rothschild problem
Oleg Pikhurko, Katherine Staden
Given a sequence of natural numbers and a graph , let denote the number of colourings of the edges of with colours $1,\dot…
math.CO2021★ 1 cited
Geometric constructions for Ramsey-Turán theory
Hong Liu, Christian Reiher, Maryam Sharifzadeh +1
Combining two classical notions in extremal combinatorics, the study of Ramsey-Turán theory seeks to determine, for integers and , the number $\mathsf{RT}_p(n,K_…