2 papers
math.OC2025
Getting to the Root of the Problem: Sums of Squares for Limits of Trees
Daniel Brosch, Diane Puges
The inducibility of a graph represents its maximum density as an induced subgraph over all possible sequences of graphs of size growing to infinity. This invariant of graphs has be…
math.OC2025
Lower and Upper Bounds for Small Canonical and Ordered Ramsey Numbers
Daniel Brosch, Bernard Lidický, Sydney Miyasaki +1
In this paper, we investigate three extensions of Ramsey numbers to other combinatorial settings. We first consider ordered Ramsey numbers. Here, we ask for a monochromatic copy of…