2 papers
math.CO2025
Ramsey-type problems for tilings in dense graphs
József Balogh, Andrea Freschi, Andrew Treglown
Given a graph , the Ramsey number is the smallest positive integer such that every -edge-colouring of yields a monochromatic copy of . We write to de…
math.CO2024
A note on colour-bias perfect matchings in hypergraphs
József Balogh, Andrew Treglown, Camila Zárate-Guerén
A result of Balogh, Csaba, Jing and Pluhár yields the minimum degree threshold that ensures a -coloured graph contains a perfect matching of significant colour-bias (i.e., a per…