A signed graph is a pair where is a graph and is a subset of edges of . A cycle of is a subset of edges of such that every vertex of the subgraph of induced by has an even degree. We say that is even …
A particularly important substructure in modeling joint linear chance-constrained programs with random right-hand sides and finite sample space is the intersection of mixing sets with common binary variables (and possibly a knapsack constraint). In this talk, we first explain basic mixing sets by establishing a strong and previously unrecognized connection to submodularity. In particular, we …
The extremal function of a graph is the supremum of densities of graphs not containing as a minor, where the density of a graph is the ratio of the number of edges to the number of vertices. Myers and Thomason (2005), Norin, Reed, Thomason and Wood (2020), and Thomason and Wales (2019) …
