5 citations · 5 across the 3 of their papers we have counts for
3 papers
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…
math.OC2024
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.OC2023★ 5 cited
Strong SDP based bounds on the cutwidth of a graph
Elisabeth Gaar, Diane Puges, Angelika Wiegele
Given a linear ordering of the vertices of a graph, the cutwidth of a vertex with respect to this ordering is the number of edges from any vertex before (including ) to…