3 papers
math.CO2025
Odd-Ramsey numbers of Hamilton cycles
Simona Boyadzhiyska, Shagnik Das, Thomas Lesgourgues +1
The odd-Ramsey number of a graph , as introduced by Alon in his work on graph-codes, is the minimum number of colours needed to edge-colour so that ev…
math.CO2024
Frequent elements in union-closed set families
Shagnik Das, Saintan Wu
The Union-Closed Sets Conjecture asks whether every union-closed set family has an element contained in half of its sets. In 2022, Nagel posed a generalisation of thi…
math.CO2024
Odd-Ramsey numbers of complete bipartite graphs
Simona Boyadzhiyska, Shagnik Das, Thomas Lesgourgues +1
In his study of graph codes, Alon introduced the concept of the odd-Ramsey number of a family of graphs in , defined as the minimum number of colours needed to c…