2 papers
math.CO2025
On minimally tough chordal graphs
Clément Dallard, Blas Fernández, Gyula Y. Katona +2
Katona and Varga showed that for any rational number , no chordal graph is minimally -tough, while Katona and Khan characterized all minimally -tough, chordal…
math.CO2025
Sets avoiding a rainbow solution to the generalized Schur equation
Ervin GyÅri, Zhen He, Zequn Lv +4
A classical result in combinatorial number theory states that the largest subset of avoiding a solution to the equation is of size . For all intege…