3 papers
math.CO2025
Infinitely many counterexamples to a conjecture of Lovász
Aida Abiad, Frederik Garbe, Xavier Povill +1
Motivated by the well-known conjecture of Ryser which relates maximum matchings to minimum vertex covers in -partite -uniform hypergraphs, Lovász formulated a stronger conjec…
math.CO2024
Forcing Graphs to be Forcing
Aldo Kiem, Olaf Parczyk, Christoph Spiegel
Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. The forcing co…
math.CO2024
An Unsure Note on an Un-Schur Problem
Olaf Parczyk, Christoph Spiegel
Graham, Rödl, and Ruciński originally posed the problem of determining the minimum number of monochromatic Schur triples that must appear in any 2-coloring of the first integer…